- 博客(33)
- 收藏
- 关注
RSS订阅原创 1025 反转链表 (25分)
1025 反转链表 (25分)AC代码#include <iostream>#include <cstdio>using namespace std;struct node{ int cur, value, nxt;}nodes[100010], ret[100010];int main(){ int ori, n, k, x, pos = 0...
2019-12-20 09:09:05
65
1
原创 1075 链表元素分类 (25分)
1075 链表元素分类 (25分)AC代码#include <iostream>#include <cstdio>using namespace std;struct node{ int cur, value, nxt;}nodes[100010], tmp[100010], tmp2[100010], tmp3[100010];int main(){...
2019-12-19 18:49:08
68
1
原创 7-22 堆栈模拟队列 (25分)
7-22 堆栈模拟队列 (25分)AC代码#include <iostream>#include <cstdio>#include <stack>#include <algorithm>using namespace std;stack<int> s1, s2;int main(){ int m, n, num;...
2019-12-19 17:04:56
111
原创 7-12 排序 (25分)
7-12 排序 (25分)AC代码#include <iostream>#include <cstdio>#include <algorithm>#include <vector>using namespace std;int main(){ int n; scanf("%d", &n); vector&...
2019-12-19 15:58:42
114
原创 7-19 求链式线性表的倒数第K项 (20分)
7-19 求链式线性表的倒数第K项 (20分)AC代码#include <iostream>#include <cstdio>#include <vector>#include <algorithm>using namespace std;vector<int> v;int main(){ int k, num;...
2019-12-19 15:52:40
289
原创 实例1.1 最大子列和问题 (20分)
实例1.1 最大子列和问题 (20分)AC代码#include <iostream>#include <cstdio>#include <algorithm>#include <cstring>#define MaxSize 100010using namespace std;int arr[MaxSize];int MCAS(in...
2019-12-19 15:27:20
124
原创 习题3.4 最长连续递增子序列 (20分)
习题3.4 最长连续递增子序列 (20分)AC代码#include <iostream>#include <cstdio>using namespace std;int num1[100005], num[100005];int main(){ int n, max = 0, maxid = 0; scanf("%d", &n); ...
2019-12-19 15:25:27
280
原创 L2-022 重排链表 (25分)
L2-022 重排链表 (25分)AC代码#include <iostream>#include <cstdio>using namespace std;struct node{ int cur, value, nxt;}nodes[100010], h[100010], ret[100010], ans[100010];int main(){ ...
2019-12-19 15:24:45
179
原创 L2-022 重排链表 (25分)
L2-022 重排链表 (25分)AC代码#include <iostream>#include <cstdio>using namespace std;struct node{ int cur, value, nxt;}nodes[100010], h[100010], ret[100010], ans[100010];int main(){ ...
2019-12-19 15:04:21
71
原创 L2-011 玩转二叉树 (25分)
L2-011 玩转二叉树 (25分)AC代码#include <iostream>#include <cstdio>#include <vector>#include <algorithm>using namespace std;struct node{ int id, index, level;};vector<no...
2019-12-19 14:31:39
149
原创 L2-006 树的遍历 (25分)
L2-006 树的遍历 (25分)AC代码#include <iostream>#include <cstdio>#include <vector>#include <algorithm>using namespace std;struct node{ int id, index, level;};vector<nod...
2019-12-19 14:11:22
86
原创 L2-002 链表去重 (25分)
L2-002 链表去重 (25分)AC代码#include <iostream>#include <cstdio>#include <algorithm>using namespace std;bool visit[10010];struct node{ int cur, value, nxt;}nodes[100010], h[1000...
2019-12-19 14:10:32
70
原创 7-53 两个有序序列的中位数 (25分)
7-53 两个有序序列的中位数 (25分)AC代码#include <iostream>#include <cstdio>#include <vector>#include <algorithm>using namespace std;vector<int> v;int main(){ int n, num; ...
2019-12-17 20:17:38
441
原创 7-52 两个有序链表序列的交集 (20分)
7-52 两个有序链表序列的交集 (20分)AC代码#include <iostream>#include <cstdio>#include <cstdlib>using namespace std;typedef struct node{ int data; struct node *nxt;}node, *linklist;l...
2019-12-17 19:37:31
340
原创 习题3.9 堆栈操作合法性 (20分)
习题3.9 堆栈操作合法性 (20分)AC代码#include <iostream>#include <cstdio>#include <stack>#include <queue>#include <map>#include <cstring>#include <vector>#include ...
2019-12-16 21:54:09
594
原创 7-51 两个有序链表序列的合并 (20分)
7-51 两个有序链表序列的合并 (20分)AC代码#include <iostream>#include <cstdio>#include <vector>#include <algorithm>#include <cstdlib>using namespace std;typedef struct node{ ...
2019-12-16 21:39:41
897
原创 1145 Hashing - Average Search Time (25分)
1145 Hashing - Average Search Time (25分)解题思想AC代码#include <iostream>#include <vector>#include <cmath>using namespace std;bool isPrime(int x) { int ret = true; for (int ...
2019-12-07 09:42:33
68
原创 1110 Complete Binary Tree (25分)
1110 Complete Binary Tree (25分)解题思想AC代码#include <iostream>#include <cstdio>#include <string>#include <cstdlib>using namespace std;struct node{ int id, l, r, index, ...
2019-12-07 09:03:50
85
原创 1147 Heaps (30分)
1147 Heaps (30分)解题思想AC代码#include <iostream>#include <vector>#include <cstdio>using namespace std;int m, n;vector<int> v;vector<int> ret;void post_order(int inde...
2019-12-06 22:53:43
75
原创 1007 Maximum Subsequence Sum (25分)
1007 Maximum Subsequence Sum (25分)解题思想AC代码#include <iostream>#include <cstdio>using namespace std;int arr[10010];int tmphead, head, tail, Max, sum;bool flag = true;void MCAS(int a...
2019-12-06 22:24:29
65
原创 1155 Heap Paths (30分)
1155 Heap Paths (30分)解题思想AC代码#include <iostream>#include <vector>using namespace std;vector<int> v;int a[1010], n, isMin = 1, isMax = 1;void dfs(int index){ if (index*2&g...
2019-12-06 22:23:41
102
原创 【Numpy】Numpy基础练习全集
【Numpy】Numpy基础练习全集目录【Numpy】Numpy基础练习全集参考网站个人练习完整代码参考网站https://www.runoob.com/numpy/numpy-tutorial.html个人练习完整代码# NumPy练习import numpy as np# ---array---# 一维数组a = np.array([1, 2, 3])print(a)# ...
2019-12-05 11:56:55
429
原创 1142 Maximal Clique (25 分)
1142 Maximal Clique (25 分)解题思想AC代码#include <iostream>#include <cstdio>#include <vector>#include <cstring>using namespace std;int e[210][210];int hashs[210];int main()...
2019-12-03 12:09:22
58
原创 1146 Topological Order (25 分)
1146 Topological Order (25 分)解题思想AC代码#include <iostream>#include <cstdio>#include <vector>using namespace std;vector<vector<int> > g;vector<int> const_inDeg...
2019-12-03 11:36:40
74
1
原创 1140 Look-and-say Sequence (20 分)
1140 Look-and-say Sequence (20 分)解题思想AC代码#include <iostream>#include <cstdio>#include <string>using namespace std;int main(){ string ori; int step, j; cin >>...
2019-12-03 00:42:45
70
原创 1093 Count PAT's (25 分)
1093 Count PAT’s (25 分)解题思想AC代码#include <iostream>#include <cstdio>#include <string>using namespace std;int main(){ string ori; cin >> ori; int countt = 0, c...
2019-12-02 23:37:17
89
原创 1126 Eulerian Path (25 分)
1126 Eulerian Path (25 分)解题思想AC代码#include <iostream>#include <cstdio>#include <vector>using namespace std;int n, m, cnt = 0;vector<vector<int> > edge;vector<b...
2019-12-02 21:05:21
73
原创 【Mac】利用Microsoft Word实现.docx与rtf之间格式转化
【Mac】利用Microsoft Word实现.docx与rtf之间格式转化使用软件操作步骤一选中Microsoft Word 在左上角文件中选择另存为操作步骤二在文件格式中选择.rtf或.docx即可实现格式转化...
2019-12-02 20:21:52
650
原创 【unordered_map】unordered_map和map的用法和区别
【unordered_map】unordered_map和map的用法和区别map容器通常比unordered_map容器慢map： map内部实现了一个红黑树，该结构具有自动排序的功能，因此map内部的所有元素都是有序的，红黑树的每一个节点都代表着map的一个元素。因此，对于map进行的查找，删除，添加等一系列的操作都相当于是对红黑树进行这样的操作，故红黑树的效率决定了map的效率。...
2019-12-02 20:09:36
126
原创 1139 First Contact (30 分)
1139 First Contact (30 分)解题思想AC代码#include <iostream>#include <vector>#include <cstdio>#include <cmath>#include <algorithm>#include <string>using namespace ...
2019-12-02 18:48:09
361
原创 1135 Is It A Red-Black Tree (30 分)
1135 Is It A Red-Black Tree (30 分)解题思想AC代码#include <iostream>#include <cstdio>#include <vector>#include <cmath>using namespace std;vector<int> arr;struct node{ ...
2019-12-02 12:32:00
83
原创 1134 Vertex Cover (25 分)
1134 Vertex Cover (25 分)解题思想AC代码#include <iostream>#include <cstdio>#include <vector>#include <cstring>using namespace std;struct edge{ int a, b;};int main(){ ...
2019-12-02 00:35:46
80
原创 1154 Vertex Coloring (25 分)
1154 Vertex Coloring (25 分)解题思想AC代码#include <iostream>#include <vector>#include <unordered_set>using namespace std;struct edge{ int a, b;};int main(){ int n, m, k; ...
2019-12-02 00:07:02
61
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人