数据结构与算法の线性结构の栈
自己学习数据结构的编程练习;
平台:MacOS Catalina
软件:Xcode
时间:20 mins
1. 栈的操作
#include <stdio.h>
#include <stdlib.h>
#include <malloc.h>
#define TRUE 1
#define FALSE 0
#define ERROR 1
#define OK 1
typedef struct Node
{
int data;
struct Node *next;
}Node,*pNode;
typedef struct Stack
{
pNode pTop;
pNode pBottom;
}Stack, *pStack;
pNode create_Node()
{
pNode p;
p = (pNode)malloc(sizeof(Node));
if(NULL == p)
{
printf("创建结点失败!\n");
exit(-1);
}
p->next=NULL;
return p;
}
void init_Stack(pStack pS)
{
pNode pHead = create_Node();
pS->pTop = pHead;
pS->pBottom = pHead;
}
int is_empty(pStack pS)
{
if(pS->pTop == pS->pBottom)
return TRUE;
else
return FALSE;
}
int push_Stack(pStack pS, int val)
{
pNode pNew = create_Node();
pNew->data = val;
pNew->next = pS->pTop; //新节点先指向当前的栈顶结点
pS->pTop = pNew; //栈顶指针指向压栈后的栈顶
return OK;
}
int pop_Stack(pStack pS, int *val)
{
pNode p = pS->pTop;
if(is_empty(pS))
{
printf("出栈失败,栈空!\n");
return ERROR;
}
*val = p->data;
pS->pTop = p->next;
free(p);
return OK;
}
int traverse_Stack(pStack pS)
{
pNode p = pS->pTop;
if(is_empty(pS))
{
printf("遍历失败,栈空!\n");
return ERROR;
}
while(p != pS->pBottom)
{
printf("%d ",p->data);
p=p->next;
}
printf("\n");
return OK;
}
void clear_Stack(pStack pS)
{
pNode p = pS->pTop;
pNode q;
if(is_empty(pS))
{
printf("清空失败,栈空!\n");
return ERROR;
}
while(p != pS->pBottom)
{
q = p->next;
free(p);
p = q;
//q = q->next;
}
pS->pTop = pS->pBottom;
}
int main()
{
Stack S;
int val;
init_Stack(&S);
push_Stack(&S, 9);
push_Stack(&S, 2);
push_Stack(&S, 6);
push_Stack(&S, 4);
push_Stack(&S, 2);
push_Stack(&S, -1);
traverse_Stack(&S);
pop_Stack(&S, &val);
traverse_Stack(&S);
pop_Stack(&S, &val);
traverse_Stack(&S);
pop_Stack(&S, &val);
traverse_Stack(&S);
pop_Stack(&S, &val);
traverse_Stack(&S);
pop_Stack(&S, &val);
traverse_Stack(&S);
pop_Stack(&S, &val);
traverse_Stack(&S);
clear_Stack(&S);
traverse_Stack(&S);
return 0;
}
2. 栈的应用-表达式
四则运算表达式在计算机中是以栈的方式进行运算,那么就需要遵循一定的规则,即:
1. 将中缀表达式转化为后缀表达式(运算符出入栈)
2. 将后缀表达式转化为运算结果 (数字出入栈)
1. 将中缀表达式转化为后缀表达式
规则: 从左到右进行遍历
- 数字:直接输出.
- ( :直接压入堆栈-(其优先级最高)
- ) :连续弹出栈顶运算符并输出直到遇到左括号(弹出但不输出)
- 符号:将该运算符与栈顶运算符进行比较,
如果优先级高于栈顶运算符则压入堆栈(该部分运算还不能进行);
如果优先级低于等于栈顶运算符则将栈顶运算符弹出并输出,然后比较新的栈顶运算符.
(低于弹出意味着前面部分可以运算,先输出的一定是高优先级运算符,等于弹出是因为同等优先级,从左到右运算)
直到优先级大于栈顶运算符或者栈空,再将该运算符入栈. - 如果对象处理完毕,则按顺序弹出并输出栈中所有运算符.
2. 将后缀表达式转化为运算结果
规则: 从左到右进行遍历
- 数字:入栈
- 符号:输出;将栈顶的连续两个数字作为运算数;计算后再将结果入栈
举例
9
+
(
3
−
1
)
×
3
+
10
÷
2
9+(3-1)\times3+10\div2
9+(3−1)×3+10÷2
分解PPT免费获取戳这里,这里!