排序
hg_zhh0427
一个普通人
展开
-
1101. Quick Sort (25)快排
There is a classical process named partition in the famous quick sort algorithm. In this process we typically choose one element as the pivot. Then the elements less than the pivot are moved to its le原创 2017-08-02 21:43:54 · 240 阅读 · 0 评论 -
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 structure contains an integer key and a Next pointer to the next structure. Now giv原创 2017-08-07 21:49:30 · 210 阅读 · 0 评论 -
1055. The World's Richest (25)
Forbes magazine publishes every year its list of billionaires based on the annual ranking of the world’s wealthiest people. Now you are supposed to simulate this job, but concentrate only on the peopl原创 2017-07-23 17:29:32 · 228 阅读 · 0 评论 -
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 and virtue. According to his theory, a man being outstanding in both talent and virt原创 2017-07-24 22:03:33 · 163 阅读 · 0 评论 -
1074. Reversing Linked List (25)
Given a constant K and a singly linked list L, you are supposed to reverse the links of every K elements on L. For example, given L being 1→2→3→4→5→6, if K = 3, then you must output 3→2→1→6→5→4; if K原创 2017-07-27 08:15:41 · 160 阅读 · 0 评论 -
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 grade in non-increasing order, and output those student records of which the grades原创 2017-07-29 10:55:54 · 199 阅读 · 0 评论 -
1089. Insert or Merge (25)
According to Wikipedia:Insertion sort iterates, consuming one input element each repetition, and growing a sorted output list. Each iteration, insertion sort removes one element from the input data, fi转载 2017-07-31 10:46:07 · 290 阅读 · 0 评论 -
1097. Deduplication on a Linked List (25)
Given a singly linked list L with integer keys, you are supposed to remove the nodes with duplicated absolute values of the keys. That is, for each value K, only the first node of which the value or a原创 2017-08-01 20:22:48 · 256 阅读 · 0 评论 -
1099. Build A Binary Search Tree (30)建立二叉搜索树
A Binary Search Tree (BST) is recursively defined as a binary tree which has the following properties:The left subtree of a node contains only nodes with keys less than the node’s key.The right subtre原创 2017-08-01 22:05:53 · 236 阅读 · 0 评论 -
1025. PAT Ranking (25)
PAT Ranking (25) 时间限制 200 ms 内存限制 65536 kB 代码长度限制 16000 B 判题程序 Standard 作者 CHEN, Yue Programming Ability Test (PAT) is organized by the College of Computer Science and Technology of Zhejiang原创 2017-07-17 08:45:26 · 140 阅读 · 0 评论