建立小顶堆，每次取出两个合并在放入堆中，直到合并成为一个 #include <stdio.h> #include <math.h> #include <stdlib.h> #include <string.h> #defin...

数组存储，一层层往下判断 #include <stdio.h> #include <math.h> #include <stdlib.h> #include <string.h> //判断 int Judge(char *...

/* * Description: 淘金 (http://noobdream.com/DreamJudge/Issue/page/1676/) * Author: 鱼翔浅底 * Date: 2021-02-22 16:52:35 */ #include <cs...

/* * Description: Buyer (http://noobdream.com/DreamJudge/Issue/page/1567/) * Author: 鱼翔浅底 * Date: 2021-02-21 12:28:18 */ #include &...

/* * Description: 最大连续子序列 (http://noobdream.com/DreamJudge/Issue/page/1334/) * Author: 鱼翔浅底 * Date: 2021-02-19 08:55:45 */ #include...

思路：遇1见一，遇0加一 ，和最大子列和差不多 /* * Description: 字符串区间翻转 (http://noobdream.com/DreamJudge/Issue/page/1642/) * Author: 鱼翔浅底 * Date: 2021...

/* * Description: 最大序列和 (http://noobdream.com/DreamJudge/Issue/page/1172/) * Author: 鱼翔浅底 * Date: 2021-02-18 16:54:58 */ #include &...

/* * Description: 生化武器2 (http://noobdream.com/DreamJudge/Issue/page/1124/) * Author: 鱼翔浅底 * Date: 2021-02-17 12:30:09 */ #include <...

递归，模拟由中序序列和先序序列生成二叉树以及后序遍历二叉树 #include <stdio.h> #include <math.h> #include <stdlib.h> #include <string.h> //后序遍...

数字的一个/2求父节点，知道两个数的父节点相同  #include <stdio.h> #include <math.h> #include <stdlib.h> #include <string.h> int m...

思路：用栈存储目前已经被扫描过但是没有适配的括号的下标，扫描完之后栈内剩下的下标指向的括号就是所有未适配的括号 #include <stdio.h> #include <math.h> #include <stdlib.h> #include...

模拟乘法  #include <stdio.h> #include <math.h> #include <stdlib.h> #include <string.h> #define max 10001 typed...

#include <stdio.h> #include <math.h> #include <stdlib.h> #include <string.h> typedef struct { char num[100...

#include <stdio.h> #include <string.h> #include <stdlib.h> typedef struct Node { char data; struct Node *Lchild...

#include <stdio.h> #include <stdlib.h> int caculation(int root,int n); int caculation(int root,int n) { if (root>n) ...

#include <stdio.h> #include <string.h> #include <stdlib.h> int main() { int n,top=-1; int a[1000]; //读取 ...

#include <stdio.h> #include <string.h> #include <stdlib.h> int main() { char s[105]; int len; gets(s...

#include <stdio.h> #include <string.h> #include <stdlib.h> int main() { char s[1000]; int cnt=0; while (...

考虑后面三个字母加三会回到开头  #include <stdio.h> #include <string.h> #include <stdlib.h> int main() { char s[100]; ...

#include <stdio.h> #include <string.h> #include <stdlib.h> int main() { int n, hour=13,minute=15; scanf("%d...