原创 1078 Hashing (25 分) 哈希探測

The task of this problem is simple: insert a sequence of distinct positive integers into a hash table, and output t

原创 1054 The Dominant Color (20 分) map集合

Behind the scenes in the computer’s memory, color is always talked about as a series of 24 bits of information for

原创 1083 List Grades (25 分) 排序

Given a list of N student records with name, ID and grade. You are supposed to sort the records with respect to the

原创 1052 Linked List Sorting (25 分) 鏈表排序

A linked list consists of a series of structures, which are not necessarily adjacent in memory. We assume that each

原创 1062 Talent and Virtue (25 分) 排序

About 900 years ago, a Chinese philosopher Sima Guang wrote a history book in which he talked about people’s talent

原创 1073 Scientific Notation (20 分) 科學計數法

Scientific notation is the way that scientists easily handle very large numbers or very small numbers. The notation

原创 1079 Total Sales of Supply Chain (25 分) DFS

A supply chain is a network of retailers(零售商), distributors(經銷商), and suppliers(供應商)-- everyone involved in moving

原创 1090 Highest Price in Supply Chain (25 分)DFS

A supply chain is a network of retailers(零售商), distributors(經銷商), and suppliers(供應商)-- everyone involved in moving

原创 基於docker搭建個人博客jpress

docker配置搭建博客參考資料docker倉庫步驟linux安裝docker運行截圖 參考資料 第一個dicker化的java應用來自慕課網 在centos上安裝docker Jpress模版 參考博客 docker倉庫 網易蜂

原创 1077 Kuchiguse (20 分) 字符串處理

The Japanese language is notorious for its sentence ending particles. Personal preference of such particles can be

原创 機器學習中的數學符號及其讀法

數學符號及讀法大全 常用數學輸入符號:  ≈ ≡≠= ≤≥ < > ≮ ≯ ∷ ±+ - × ÷ / ∫∮ ∝ ∞  ∧ ∨ ∑∏∪ ∩ ∈ ∵ ∴  ⊥ ‖ ∠ ⌒  ≌ ∽ √   () 【】{} Ⅰ Ⅱ ⊕ ⊙∥

原创 PAT甲級英文單詞整理

non-leaf nodes 非葉子結點 every seniority level 每一層 vertices 頂點 edges 邊 indices 索引 labeling 標記 implementation 實現 Topolog

原创 SSH整合配置(Spring+SpringMVC+JPA)

SSH整合配置依賴配置Spring配置(包括整合JPA)SpringMVC配置配置web.xml技巧使用SSH整合開發的一個項目github首頁截圖整合配置代碼applicationContext.xmldispatcher-se

原创 1095 Cars on Campus (30 分) 排序

Zhejiang University has 8 campuses and a lot of gates. From each gate we can collect the in/out times and the plate

原创 1113 Integer Set Partition (25 分) 排序

Given a set of N (>1) positive integers, you are supposed to partition them into two disjoint sets A​1 and A2 of n1