qq_46699502的博客

野指针，简单来说就是， #include <stdlib.h> #include<stdio.h> int main() { int* p1, *p2, *p3; // 定义三个整型指针 p1 = (int*)malloc(4); // 申请4字节空间，存放整型数1 *p1 = 1; p2 = (int*)malloc(4);//申请4字节空间，存放整型数2 *p2 = 2; free(p1);//释放原为p1申请的空间，但未...

利用栈实现对简单中缀表达式转后缀，并计算结果（仅支持一位整数）

#include<stdio.h> #include<stdlib.h> #define MaxSize 10 #define true 1 #define false 0 typedef char ElemType; typedef int bool; typedef struct { ElemType data[MaxSize]; int top; }Stack, * SqStack; //初始化栈 bool InitStack(SqStack* S) {...

#include <stdio.h> #include <stdlib.h> #define MAXSIZE 10 #define true 1 #define false 0 typedef int bool; typedef int ElemType; typedef struct LinkNode { ElemType data; struct LinkNode* next; }LinkNode; typedef struct { LinkN...

#include<stdio.h> #include<stdlib.h> #define true 1 #define false 0 typedef int ElemType; typedef int bool; typedef struct LinkNode { ElemType data; struct LinkNode* next; }LinkNode, * LinkStack; //初始化栈 bool InitStack(LinkStack* S)...

#include<stdio.h> #include<stdlib.h> #define ElemType int #define MaxSize 10 #define true 1 #define false 0 typedef int bool; //定义单链表节点 typedef struct DLNode { ElemType data; struct DLNode* prior,* next; }DLNode, * DLinkList; //初始化...

#include<stdio.h> #include<stdlib.h> #define ElemType int #define MaxSize 10 #define true 1 #define false 0 typedef int bool; //定义单链表节点 typedef struct LNode { ElemType data; struct LNode* next; }LNode, * LinkList; //初始化链表 bool Init...

实现