一个正在路上的学生

LinkStack.cpp#include "LinkStack.h"#include<stdio.h>#include<stdlib.h>LinkStack *Init_LinkStack(){ LinkStack *stack = (LinkStack*)malloc(sizeof(LinkStack)); stack->head.next = NUL...

#define _CRT_SECURE_NO_WARNINGS#include<iostream>using namespace std;void PrintArray(int arr[], int len){ for (int i = 0; i < len; i++) { cout << arr[i] <<""; } cout &lt...

#define _CRT_NO_SECURE_WANRINGS#include "SeqStack.h"#include<stdio.h>#include<stdlib.h>int main(void){ SeqStack*stack =Init_SeqStack(); char *str = "1+5+(dsf)gahdah()f("; cha...

//分组 插入排序//先分组 然后对每一组分别进行插入排序//合组 然后再插入排序//分组增量是：increasement/3+1#define _CRT_SECURE_NO_WARNINGS#include<stdio.h>#include<stdlib.h>#include<string.h>#include<sys/timeb.h&g...

#include<iostream>#include<iomanip>using namespace std;#define SIZE 8int main(int argc, char**argv) { int maxtrix[SIZE][SIZE] = { 0 }; int a[SIZE][SIZE] = { 0 }; int *p = NULL; p ...

#define _CRT_SECURE_NO_WARNINGS#include<stdio.h>#include<stdlib.h>#include<string.h>#include<sys/timeb.h>#include<time.h>#define MAX 10long getSystemTime(){ struc...

1.将树的结点与一个FALSE标志位合一起压栈2.判断栈中元素个数是否为空3.栈顶元素出栈，将其标志位变成TRUE，同时将其左右树结点与FALSE标志位合一起压栈。#define _CRT_SECURE_NO_WARNINGS#include<stdio.h>#include<stdlib.h>#include<string.h>#include .

SeqStack.cpp#include "SeqStack.h"#include<stdio.h>#include<stdlib.h>typedef struct PERSON{ char name[64]; int age;}Person;int main(void){ //创建栈 SeqStack *stack = Init_SeqStack()...

#include<iostream>#include<stdlib.h>using namespace std;int MaxSubsequenceSum(int a[],int length){ int MaxSum = 0; int ThisSum,SeqStart,SeqEnd; for (int i = 0; i < length; i++) ...

统计二叉树中叶子结点的个数：叶子节点：没有孩子节点的树demo.cpp#define _CRT_SECURE_NO_WARNINGS#include<stdio.h>#include<stdlib.h>#include<string>//二叉树结点typedef struct BINARYNODE{ char ch; struct BINAR...

如上图所示：先序遍历(DLR)：先访问根 再访问左 再就是右：ABCDEFGH中序遍历(LDR)：先左再根再右：BDCCEAFHG后序遍历(LRD)：先左再右再根:DECBHGFA递归遍历(先序遍历)：#define _CRT_SECURE_NO_WARNINGS#include<stdio.h>#include<stdlib.h>#include&...

#include<stdio.h>#include<string>#include<iostream>using namespace std;int main(void){ string str[] = { "abc", "ac", "c", "abcd" }; int length = sizeof(str) / sizeof(st

后缀表达式的由来，请看资源：https://blog.csdn.net/qq_23859701/article/details/82918771现在是后缀表达式的求解：demo.cpp#define _CRT_SECURE_NO_WARNINGS#include<stdio.h>#include<stdlib.h>#include<string.h>...

理论知识demo.cpp#define _CRT_SECURE_NO_WARNINGS#include "LinkStack.h"#include<stdio.h>#include<stdlib.h>#include<string>//是否是数字int IsNumber(char c){ retur

#define _CRT_SECURE_NO_WARNINGS#include<iostream>#include<time.h>using namespace std;#define MAX 10int* CreateArray(){ int *arr = (int*)malloc(sizeof(int)*MAX); srand((unsigned int...