丧心病狂工科女

2019年1月30日

摘要： https://leetcode.com/problems/sort-list/ Sort a linked list in O(n log n) time using constant space complexity. Example 1: Example 2: 代码：归并排序学到了 FHF 阅读全文

posted @ 2019-01-30 14:08 丧心病狂工科女阅读(106) 评论(0) 推荐(0) 编辑

PAT 甲级 1138 Postorder Traversal

摘要： https://pintia.cn/problem-sets/994805342720868352/problems/994805345078067200 Suppose that all the keys in a binary tree are distinct positive integer 阅读全文

posted @ 2019-01-30 13:43 丧心病狂工科女阅读(226) 评论(0) 推荐(0) 编辑

PAT 甲级 1141 PAT Ranking of Institutions

摘要： https://pintia.cn/problem-sets/994805342720868352/problems/994805344222429184 After each PAT, the PAT Center will announce the ranking of institutions 阅读全文

posted @ 2019-01-30 12:09 丧心病狂工科女阅读(382) 评论(0) 推荐(0) 编辑

PAT 甲级 1142 Maximal Clique

摘要： https://pintia.cn/problem-sets/994805342720868352/problems/994805343979159552 A clique is a subset of vertices of an undirected graph such that every 阅读全文

posted @ 2019-01-30 11:21 丧心病狂工科女阅读(152) 评论(0) 推荐(0) 编辑

PAT 甲级 1146 Topological Order

摘要： https://pintia.cn/problem-sets/994805342720868352/problems/994805343043829760 This is a problem given in the Graduate Entrance Exam in 2018: Which of 阅读全文

posted @ 2019-01-30 10:48 丧心病狂工科女阅读(175) 评论(0) 推荐(0) 编辑

PAT 甲级 1143 Lowest Common Ancestor

摘要： https://pintia.cn/problem-sets/994805342720868352/problems/994805343727501312 The lowest common ancestor (LCA) of two nodes U and V in a tree is the d 阅读全文

posted @ 2019-01-30 10:24 丧心病狂工科女阅读(283) 评论(0) 推荐(0) 编辑

2019年1月29日

#Leetcode# 347. Top K Frequent Elements

摘要： https://leetcode.com/problems/top-k-frequent-elements/ Given a non-empty array of integers, return the k most frequent elements. Example 1: Example 2: 阅读全文

posted @ 2019-01-29 22:25 丧心病狂工科女阅读(141) 评论(0) 推荐(0) 编辑

牛客寒假算法基础集训营4

摘要： https://ac.nowcoder.com/acm/contest/330#question A.Applese 的取石子游戏 #include <bits/stdc++.h> using namespace std; const int maxn = 1e5 + 10; int N; int 阅读全文

posted @ 2019-01-29 20:43 丧心病狂工科女阅读(364) 评论(0) 推荐(0) 编辑

PAT 1147 Heaps

摘要： https://pintia.cn/problem-sets/994805342720868352/problems/994805342821531648 In computer science, a heap is a specialized tree-based data structure t 阅读全文

posted @ 2019-01-29 20:27 丧心病狂工科女阅读(101) 评论(0) 推荐(0) 编辑

PAT 甲级 1150 Travelling Salesman Problem

摘要： https://pintia.cn/problem-sets/994805342720868352/problems/1038430013544464384 The "travelling salesman problem" asks the following question: "Given a 阅读全文

posted @ 2019-01-29 12:39 丧心病狂工科女阅读(404) 评论(0) 推荐(0) 编辑

丧心病狂工科女

公告