做题记录
码敲百遍,其义自见~
_Hsiung
这个作者很懒,什么都没留下…
展开
-
最大回文子串长度 [dp]
dp 将复杂度降到n平方#include<iostream>#include<vector>#include<queue>#include<stack>#include<string>#include<math.h>#include<algorithm>#include<map>#include<cstring>#include<set>using namespace原创 2020-08-05 22:40:37 · 121 阅读 · 0 评论 -
计算器的制作(不支持负数和小数)
这个利用堆栈做成的简易计算器,但是只能支持不带小数的计算,刚刚想了一会没钻研出来小数的计算,等我钻研出来了继续更新。需要提前掌握堆栈 中缀表达式转后缀表达式的知识点。水平有限,请多多指教相互学习嘻嘻。#include<iostream>#include<string>#include<stack>using namespace std;doub...原创 2020-04-03 10:48:45 · 247 阅读 · 0 评论 -
1009 说反话
1009 说反话 (20分)给定一句英语,要求你编写程序,将句中所有单词的顺序颠倒输出。输入格式:测试输入包含一个测试用例,在一行内给出总长度不超过 80 的字符串。字符串由若干单词和若干空格组成,其中单词是由英文字母(大小写有区分)组成的字符串,单词之间用 1 个空格分开,输入保证句子末尾没有多余的空格。输出格式:每个测试用例的输出占一行,输出倒序后的句子。输入样例:Hello World Here I Come输出样例:Come I Here World Hello#include&原创 2020-06-19 15:05:41 · 83 阅读 · 0 评论 -
bfs 找步数最少的迷宫路径
11步#include<iostream>#include<queue>using namespace std;const int maxn = 100;struct node{ int x, y; int step;}S,T,Node;int n, m;char map[maxn][maxn];bool inqueue[maxn][maxn] = { false };int x[4] = { 0,0,1,-1 };int y[4] = { 1,-1,0,原创 2020-07-22 17:05:45 · 118 阅读 · 0 评论 -
函数模板的琐碎笔记
#include<iostream>#include<vector>#include<map>#include<string>#include<cstring>#include<cstdio>#include<algorithm>#include<set>#include<queue>#include<unordered_map>#include<cmath>原创 2020-08-20 19:54:05 · 82 阅读 · 0 评论 -
11.散列2 Hashing [二次探测(平方探测)法]
11-散列2 Hashing (25分)The task of this problem is simple: insert a sequence of distinct positive integers into a hash table, and output the positions of the input numbers. The hash function is defined to be H(key)=key%TSize where TSize is the maximum size o原创 2020-05-12 16:58:48 · 427 阅读 · 0 评论 -
11.散列1 电话聊天狂人 [分离链表法]
11-散列1 电话聊天狂人 (25分)给定大量手机用户通话记录,找出其中通话次数最多的聊天狂人。输入格式:输入首先给出正整数N(≤105 ),为通话记录条数。随后N行,每行给出一条通话记录。简单起见,这里只列出拨出方和接收方的11位数字构成的手机号码,其中以空格分隔。输出格式:在一行中给出聊天狂人的手机号码及其通话次数,其间以空格分隔。如果这样的人不唯一,则输出狂人中最小的号码及其通话次数,并且附加给出并列狂人的人数。输入样例:413005711862 1358862583213505原创 2020-05-12 15:06:28 · 207 阅读 · 0 评论 -
分蛋糕 [dp]
原创 2020-08-26 09:07:22 · 111 阅读 · 0 评论 -
01 背包问题
二维数组#include <iostream>#include <string>#include <math.h>#include<algorithm>#include<cstdio>#include<string.h>using namespace std;int n, c;int m[1000], v[1000];int f[1000][1000];int main(){ cin >> c &g原创 2020-08-26 08:05:02 · 90 阅读 · 0 评论 -
神奇的口袋[dp]
#include <iostream>#include <string>#include <math.h>#include<algorithm>#include<cstdio>#include<string.h>using namespace std;int n;int a[50];int dp[40][30];int main(){ cin >> n; memset(dp, 0, sizeof(.原创 2020-08-25 21:52:35 · 236 阅读 · 0 评论 -
滑雪[dp]
#include <iostream>#include <string>#include <math.h>#include<algorithm>#include<cstdio>#include<string.h>using namespace std;int f[105][105];int a[105][105];struct Node{ int x; int y; int h;}node[10005];.原创 2020-08-25 21:23:56 · 72 阅读 · 0 评论 -
Help Jimmy[dp]
#include <iostream>#include <string>#include <math.h>#include<algorithm>#include<cstdio>#include<string.h>using namespace std;const int N = 1010;const int inf = 0x3f;struct time{ int x1, x2, h;}a[N];int dp[.原创 2020-08-25 18:08:31 · 78 阅读 · 0 评论 -
最佳加法表达式 [dp]
#include <iostream>#include <string>#include <math.h>#include<algorithm>using namespace std;const int maxn = 1010;int a[maxn], num[maxn][maxn], dp[maxn][maxn];//num[u][v]代表u到v位的数字int main(){ int n, m; while (cin >>.原创 2020-08-24 22:14:26 · 82 阅读 · 0 评论 -
动态规划 [子序列问题]
最长上升子序列#include <iostream>#include <string>#include <math.h>#include<algorithm>using namespace std;const int maxn = 1010;int a[maxn]; int maxLen[maxn];int main(){ int n; cin >> n; for (int i = 1; i <= n; i++) {原创 2020-08-24 22:13:50 · 112 阅读 · 0 评论 -
部分翻转链表
#include<iostream>using namespace std;const int maxn = 100;struct node{ int data; node* next;};typedef node* list;list insert(list a,int x){ if (a == NULL) { list temp = new node; temp->data = x; temp->next = a; a = temp; }原创 2020-10-08 16:11:31 · 174 阅读 · 0 评论 -
双向链表
试设计一个算法,改造一个带表头结点的双向链表,所有结点的原有次序保持在各个结点的右链域rLink中,并利用左链域ILink把所有结点按照其值从小到大的顺序连接起来。#include<iostream>using namespace std;struct node{ int data; node* left, * right;};typedef node* list;list init(){ list temp = new node; temp->left = tem原创 2020-09-24 22:01:47 · 416 阅读 · 0 评论 -
删除在链表区间值的元素
#include<iostream>using namespace std;#include<vector>struct node{ int data; node* next;};typedef node* list;list init(){ list a = new node; a->next = NULL; return a;}list insert(list a,int i,int x){ list p = a; for (int k原创 2020-09-19 21:34:41 · 328 阅读 · 0 评论 -
循环链表解决约瑟夫环问题
#include<iostream>using namespace std;typedef struct node* list;struct node{ int data; node* next;};list insert(list l,int x){ node* newNode = new node; newNode->data = x; if (l==NULL) { newNode->next = newNode; l = newNode; }原创 2020-09-13 14:24:19 · 185 阅读 · 0 评论 -
合并两个链表从小到大输出(c++)
#include <iostream>using namespace std;typedef int ElementType;typedef struct Node* PtrToNode;struct Node { ElementType Data; PtrToNode Next;};typedef PtrToNode List;List Read(); /* ...原创 2020-04-05 20:51:17 · 509 阅读 · 0 评论 -
链表实现一元多项式加法和乘法
输入:4 3 4 -5 2 6 1 -2 0(4为系数和指数的总对数)3 5 20 -7 4 3 1(3为系数和指数的总对数)输出:15 24 -25 22 30 21 -10 20 -21 8 35 6 -33 5 14 4 -15 3 18 2 -6 15 20 -4 4 -5 2 9 1 -2 0#include<iostream>using namesp...原创 2020-04-05 15:09:00 · 395 阅读 · 0 评论 -
C++链表实现( 数据结构 易)
楼主编程小白一个 最近在学数据结构,分享下自己的链表学习代码,欢迎大家指教和讨论。如有不懂,也欢迎提问,不过我真是菜鸡一个哈哈。#include<iostream>#include<malloc.h>using namespace std;typedef int ElementType;typedef struct LNode *List; ...原创 2020-03-30 23:32:43 · 212 阅读 · 0 评论 -
A1155 Heap Paths [堆的dfs]
#include<iostream>#include<vector>#include<map>#include<string>#include<cstring>#include<cstdio>#include<algorithm>#include<set>#include<queue>#include<unordered_map>#include<cmath&g.原创 2020-08-16 22:26:10 · 73 阅读 · 0 评论 -
A1154 Vertex Coloring
#include<iostream>#include<vector>#include<map>#include<string>#include<cstring>#include<cstdio>#include<algorithm>#include<set>#include<queue>#include<unordered_map>#include<cmath&g.原创 2020-08-16 17:58:55 · 70 阅读 · 0 评论 -
A1153 Decode Registration Card of PAT
#include<iostream>#include<vector>#include<map>#include<string>#include<cstring>#include<cstdio>#include<algorithm>#include<set>#include<queue>#include<unordered_map>#include<cmath&g.原创 2020-08-16 17:06:38 · 78 阅读 · 0 评论 -
A1151 LCA in a Binary Tree [先序中序建树找祖先]
对LCA递归的理解: (代码参考的大佬 理解这个花了蛮久 唉老蠢啦)什么是什么的父节点就是搜索到这个结点的值等于u或者v就停下来然后它是先往左边右边进行搜索,搜索到第一个结点的儿子节点相等的 就是最高的就停下来了,如果右边找不到 说明另一个还没找到的结点在左边已经找到的结点的更深处。#include<iostream>#include<vector>#include<map>#include<string>#include<cstring.原创 2020-08-16 15:25:09 · 86 阅读 · 0 评论 -
A1150 Travelling Salesman Problem [模拟图]
#include<iostream>#include<vector>#include<map>#include<string>#include<cstring>#include<cstdio>#include<algorithm>#include<set>#include<queue>#include<unordered_map>#include<cmath&g.原创 2020-08-16 11:23:52 · 78 阅读 · 0 评论 -
A1149 Dangerous Goods Packaging
#include<iostream>#include<vector>#include<map>#include<string>#include<cstring>#include<cstdio>#include<algorithm>#include<set>#include<queue>#include<unordered_map>#include<cmath&g.原创 2020-08-15 22:31:32 · 103 阅读 · 0 评论 -
A1148 Werewolf - Simple Version [模拟]
#include<iostream>#include<vector>#include<map>#include<string>#include<cstring>#include<cstdio>#include<algorithm>#include<set>#include<queue>#include<unordered_map>#include<cmath&g.原创 2020-08-15 18:05:17 · 121 阅读 · 0 评论 -
A1147 Heaps
#include<iostream>#include<vector>#include<map>#include<string>#include<cstring>#include<cstdio>#include<algorithm>#include<set>#include<queue>#include<unordered_map>#include<cmath&g.原创 2020-08-15 15:53:26 · 77 阅读 · 0 评论 -
A1146 Topological Order
#include<iostream>#include<vector>#include<map>#include<string>#include<cstring>#include<cstdio>#include<algorithm>#include<set>#include<queue>#include<unordered_map>#include<cmath&g.原创 2020-08-15 14:42:45 · 84 阅读 · 0 评论 -
A1145 Hashing - Average Search Time [平方探测法]
#include<iostream>#include<vector>#include<map>#include<string>#include<cstring>#include<cstdio>#include<algorithm>#include<set>#include<queue>#include<unordered_map>#include<cmath&..原创 2020-08-15 10:06:20 · 102 阅读 · 0 评论 -
A1142 Maximal Clique[图模拟]
#include<iostream>#include<vector>#include<map>#include<string>#include<cstring>#include<cstdio>#include<algorithm>#include<set>#include<queue>#include<unordered_map>using namespace std.原创 2020-08-15 07:55:10 · 93 阅读 · 0 评论 -
A1141 PAT Ranking of Institutions [stl]
注意最后一个测试点用unordered_map#include<iostream>#include<vector>#include<map>#include<string>#include<cstring>#include<cstdio>#include<algorithm>#include<set>#include<queue>#include<unordered_map.原创 2020-08-14 20:54:04 · 84 阅读 · 0 评论 -
A1140 Look-and-say Sequence [模拟]
题目大意:给两个数字D和n,第一个序列是D,后一个序列描述前一个序列的所有数字以及这个数字出现的次数,比如D出现了1次,那么第二个序列就是D1,对于第二个序列D1,第三个序列这样描述:D出现1次,1出现1次,所以是D111……以此类推,输出第n个序列~#include<iostream>#include<vector>#include<map>#include<string>#include<cstring>#include<c.原创 2020-08-14 16:41:31 · 75 阅读 · 0 评论 -
A1137 Final Grading
#include<iostream>#include<vector>#include<map>#include<string>#include<cstring>#include<cstdio>#include<algorithm>#include<set>#include<queue>#include<unordered_set>using namespace std.原创 2020-08-14 14:36:43 · 104 阅读 · 0 评论 -
A1136 A Delayed Palindrome [大整数运算] [字符串操作]
首先涉及10位数字相加,考虑用大整数运算了,注意字符串赋值不能直接一个一个赋值,要采取拼接+s 或者赋值一个一个替换,因为要提前知道大小。然后注意大整数加法运算。#include<iostream>#include<vector>#include<map>#include<string>#include<cstring>#include<cstdio>#include<algorithm>#include.原创 2020-08-13 22:46:59 · 138 阅读 · 0 评论 -
A1133 Splitting A Linked List
#include<iostream>#include<vector>#include<map>#include<string>#include<cstring>#include<cstdio>#include<algorithm>#include<set>#include<queue>#include<unordered_set>using namespace std.原创 2020-08-13 18:35:00 · 114 阅读 · 0 评论 -
A1129 Recommendation System [set自定义排序]
#include<iostream>#include<vector>#include<map>#include<string>#include<cstring>#include<cstdio>#include<algorithm>#include<set>#include<queue>#include<unordered_set>using namespace std.原创 2020-08-12 11:17:15 · 89 阅读 · 0 评论 -
A1128 N Queens Puzzle
#include<iostream>#include<vector>#include<map>#include<string>#include<cstring>#include<cstdio>#include<algorithm>#include<set>#include<queue>using namespace std;int main(){ int n, m; cin.原创 2020-08-12 08:26:06 · 77 阅读 · 1 评论 -
A1126 Eulerian Path [欧拉图]
欧拉图 节点度为0或2 半欧拉两个结点度为奇数,其他偶数。 同时要保证其为连通图(任意两个结点能走到)#include<iostream>#include<vector>#include<map>#include<string>#include<cstring>#include<cstdio>#include<algorithm>#include<set>using namespace std.原创 2020-08-11 21:13:01 · 114 阅读 · 0 评论