目录
栈的定义:
栈是一种“先进后出”的一种数据结构,有压栈出栈两种操作方式。
定义结构体:
typedef struct CharStack {
int top;
int data[STACK_MAX_SIZE];
} *CharStackPtr;
输出堆栈:
void outputStack(CharStackPtr paraStack) {
for (int i = 0; i <= paraStack->top; i ++) {
printf("%c ", paraStack->data[i]);
}// Of for i
printf("\r\n");
}
栈的初始化:
CharStackPtr charStackInit() {
CharStackPtr resultPtr = (CharStackPtr)malloc(sizeof(struct CharStack));
resultPtr->top = -1;
return resultPtr;
}
入栈:
void push(CharStackPtr paraStackPtr, int paraValue) {
if (paraStackPtr->top >= STACK_MAX_SIZE - 1) {
printf("Cannot push element: stack full.\r\n");
return;
}
paraStackPtr->top ++;
paraStackPtr->data[paraStackPtr->top] = paraValue;
}
出栈:
char pop(CharStackPtr paraStackPtr) {
if (paraStackPtr->top < 0) {
printf("Cannot pop element: stack empty.\r\n");
return '\0';
}
paraStackPtr->top --;
return paraStackPtr->data[paraStackPtr->top + 1];
}
括号匹配:
bool bracketMatching(char* paraString, int paraLength) {
CharStackPtr tempStack = charStackInit();
push(tempStack, '#');
char tempChar, tempPopedChar;
for (int i = 0; i < paraLength; i++) {
tempChar = paraString[i];
switch (tempChar) {
case '(':
case '[':
case '{':
push(tempStack, tempChar);
break;
case ')':
tempPopedChar = pop(tempStack);
if (tempPopedChar != '(') {
return false;
}
break;
case ']':
tempPopedChar = pop(tempStack);
if (tempPopedChar != '[') {
return false;
}
break;
case '}':
tempPopedChar = pop(tempStack);
if (tempPopedChar != '{') {
return false;
}
break;
default:
break;
}
}
tempPopedChar = pop(tempStack);
if (tempPopedChar != '#') {
return true;
}
return true;
}
完整代码:
#include <stdio.h>
#include <malloc.h>
#define STACK_MAX_SIZE 10
typedef struct CharStack {
int top;
int data[STACK_MAX_SIZE];
} *CharStackPtr;
void outputStack(CharStackPtr paraStack) {
for (int i = 0; i <= paraStack->top; i ++) {
printf("%c ", paraStack->data[i]);
}// Of for i
printf("\r\n");
}
CharStackPtr charStackInit() {
CharStackPtr resultPtr = (CharStackPtr)malloc(sizeof(struct CharStack));
resultPtr->top = -1;
return resultPtr;
}
void push(CharStackPtr paraStackPtr, int paraValue) {
if (paraStackPtr->top >= STACK_MAX_SIZE - 1) {
printf("Cannot push element: stack full.\r\n");
return;
}
paraStackPtr->top ++;
paraStackPtr->data[paraStackPtr->top] = paraValue;
}
char pop(CharStackPtr paraStackPtr) {
if (paraStackPtr->top < 0) {
printf("Cannot pop element: stack empty.\r\n");
return '\0';
}
paraStackPtr->top --;
return paraStackPtr->data[paraStackPtr->top + 1];
}
bool bracketMatching(char* paraString, int paraLength) {
CharStackPtr tempStack = charStackInit();
push(tempStack, '#');
char tempChar, tempPopedChar;
for (int i = 0; i < paraLength; i++) {
tempChar = paraString[i];
switch (tempChar) {
case '(':
case '[':
case '{':
push(tempStack, tempChar);
break;
case ')':
tempPopedChar = pop(tempStack);
if (tempPopedChar != '(') {
return false;
}
break;
case ']':
tempPopedChar = pop(tempStack);
if (tempPopedChar != '[') {
return false;
}
break;
case '}':
tempPopedChar = pop(tempStack);
if (tempPopedChar != '{') {
return false;
}
break;
default:
break;
}
}
tempPopedChar = pop(tempStack);
if (tempPopedChar != '#') {
return true;
}
return true;
}
void bracketMatchingTest() {
char* tempExpression = "[2 + (1 - 3)] * 4";
bool tempMatch = bracketMatching(tempExpression, 17);
printf("Is the expression '%s' bracket matching? %d \r\n", tempExpression, tempMatch);
tempExpression = "( ) )";
tempMatch = bracketMatching(tempExpression, 6);
printf("Is the expression '%s' bracket matching? %d \r\n", tempExpression, tempMatch);
tempExpression = "()()(())";
tempMatch = bracketMatching(tempExpression, 8);
printf("Is the expression '%s' bracket matching? %d \r\n", tempExpression, tempMatch);
tempExpression = "({}[])";
tempMatch = bracketMatching(tempExpression, 6);
printf("Is the expression '%s' bracket matching? %d \r\n", tempExpression, tempMatch);
tempExpression = ")(";
tempMatch = bracketMatching(tempExpression, 2);
printf("Is the expression '%s' bracket matching? %d \r\n", tempExpression, tempMatch);
}
int main() {
bracketMatchingTest();
return 0;
}
运行结果:
Is the expression '[2 + (1 - 3)] * 4' bracket matching? 1
Is the expression '( ) )' bracket matching? 0
Is the expression '()()(())' bracket matching? 1
Is the expression '({}[])' bracket matching? 1
Is the expression ')(' bracket matching? 0
--------------------------------
Process exited after 0.03828 seconds with return value 0
请按任意键继续. . .
表达式求值:
#include <stdio.h>
#include <stdlib.h>
#include <ctype.h>
#define Maxsize 100
typedef int dataType;
typedef struct Stack
{
dataType *top;
dataType *base;
int stacksize;
}sqstack;
void create(sqstack *s)
{
s->base=(dataType *)malloc(Maxsize*sizeof(dataType));
if(!s->base)
{
printf("Space allocation failed!\n");
return;
}
s->top=s->base;
s->stacksize=Maxsize;
return;
}
int push_in(sqstack *s,dataType value)
{
if(s->top-s->base==s->stacksize)
{
printf("Stack is full!\n");
return;
}
*s->top=value; //"*s->top++=value;"
s->top++;
return;
}
int pop_out(sqstack *s,dataType *elem)
{
if(s->base==s->top)
{
printf("Stack is empty!");
return;
}
s->top--;
*elem=*s->top; //"*elem=*--s->top;"
return;
}
dataType GetTop(sqstack *s)
{
if(s->base==s->top)
{
printf("Stack is empty!\n");
printf("Unable to fetch top stack element!\n");
return;
}
return *(s->top-1);
}
char Precede(char theta1,char theta2)
{
int i,j;
char pre[7][7]={// + - * / ( ) =
{'>','>','<','<','<','>','>'},
{'>','>','<','<','<','>','>'},
{'>','>','>','>','<','>','>'},
{'>','>','>','>','<','>','>'},
{'<','<','<','<','<','=','0'},
{'>','>','>','>','0','>','>'},
{'<','<','<','<','<','0','='}};
switch(theta1){
case '+': i=0; break;
case '-': i=1; break;
case '*': i=2; break;
case '/': i=3; break;
case '(': i=4; break;
case ')': i=5; break;
case '=': i=6; break;
}
switch(theta2){
case '+': j=0; break;
case '-': j=1; break;
case '*': j=2; break;
case '/': j=3; break;
case '(': j=4; break;
case ')': j=5; break;
case '=': j=6; break;
}
return(pre[i][j]);
}
int Operate(int a,char theta,int b)
{
int result;
switch(theta){
case'+':return a+b;
case'-':return a-b;
case'*':return a*b;
case'/': //判断除数是否为0,若除数为零返回错误提示
if(b!=0)
return a/b;
else
{
printf("Divisor can not Be zero!\n");
exit(0);
}
}
}
int In(char c) //判断是否为运算符,是运算符返回1,若不是返回0
{
switch(c){
case '+':
case '-':
case '*':
case '/':
case '(':
case ')':
case '=':
return 1;
default:
return 0;
}
}
int evaluateExpression(char exp[])
{
sqstack OPND,OPTR;
dataType a,b,theta,x,X1,X2;
char ch;
int i=0;
create(&OPND);
create(&OPTR);
push_in(&OPTR,'=');
ch=exp[i++];
while(ch!='='||GetTop(&OPTR)!='=')
{
if(In(ch))
{
switch(Precede(GetTop(&OPTR),ch))
{
case'<':
push_in(&OPTR,ch);
ch=exp[i++];
break;
case'>':
pop_out(&OPTR,&theta);
pop_out(&OPND,&b);
pop_out(&OPND,&a);
push_in(&OPND,Operate(a,theta,b));
break;
case'=':
pop_out(&OPTR,&x);
ch=exp[i++];
break;
}
}
else if(isdigit(ch))
{
X1=ch-'0';
push_in(&OPND,X1);
X2=X1;
ch=exp[i++];
while(isdigit(ch)) {
X1=ch-'0';
X2=10*X2+X1;
pop_out(&OPND,&x);
push_in(&OPND,X2);
ch=exp[i++];
}
}
else if(ch==' ')
{
while(ch==' ')
{
ch=exp[i++];
}
}
else
{
printf("Input has illegal characters!\n");
printf("Please enter again.\n");
exit(0);
}
}
return(GetTop(&OPND));
}
int main()
{
char exp[100];
int result;
printf("Please Enter Expression:");
gets(exp);
result=evaluateExpression(exp);
printf("\n");
printf("%s%d\n",exp,result);
return 0;
}
运行结果: