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) 编辑
PAT 甲级 1154 Vertex Coloring
摘要： https://pintia.cn/problem-sets/994805342720868352/problems/1071785301894295552 A proper vertex coloring is a labeling of the graph's vertices with col 阅读全文
posted @ 2019-01-29 10:51 丧心病狂工科女 阅读(160) 评论(0) 推荐(0) 编辑