栈(Stack) 要求用户输入一串圆括号或花括号,然后指出它们之间的嵌套是否正确。
输出范例:
Enter parentheses and/or braces: ()({})({})
Parentheses/braces are nested properly
Enter parentheses and/or braces: ((}
Parentheses/braces are NOT nested properly
————————————————
#include <stdbool.h> /* C99 only */
#include <stdio.h>
#include <stdlib.h>
#define STACK_SIZE 100
/* external variables */
char contents[STACK_SIZE];
int top = 0;
void stack_overflow(void)
{
printf("Stack overflow\n");
exit(EXIT_FAILURE);
}
void stack_underflow(void)
{
printf("Stack underflow\n");
exit(EXIT_FAILURE);
}
void make_empty(void)
{
top = 0;
}
bool is_empty(void)
{
return top == 0;
}
bool is_full(void)
{
return top == STACK_SIZE;
}
void push(char ch)
{
if (is_full())
stack_overflow();
else
contents[top++] = ch;
}
char pop(void)
{
if (is_empty())
stack_underflow();
else
return contents[--top];
return '\0'; /* prevents compiler warning due to stack_underflow() call */
}
int main(void)
{
int x,y;
char ch;
printf("Enter parentheses and/or braces:");
ch=getchar();
for(;ch!='\n';)
{
push (ch);
ch=getchar();
}
if(contents[0]==')'||contents[0]=='}'||contents[top-1]=='('||contents[top-1]=='{')
printf("Parentheses/braces are NOT nested properly");
else if(top % 2 ==0)
{
for(x=0;x<top;++x)
{
if(contents[x]=='(')
{
for(y=1;y<top;++y)
{
if(y==top-1)
{
printf("Parentheses/braces are NOT nested properly");
goto L;
}
else if(contents[x+y]==')')
{
contents[x+y]='0';
contents[x]='0';
y=top;
}
else break;
}
}
else if(contents[x]=='{')
{
for(y=1;y<top;++y)
{
if(y==top-1)
{
printf("Parentheses/braces are NOT nested properly");
goto L;
}
else if(contents[x+y]=='}')
{
contents[x+y]='0';
contents[x]='0';
y=top;
}
else break;
}
}
else if(contents[x]==')')
{
for(y=1;y<top;++y)
{
if(x-y==0)
{
printf("Parentheses/braces are NOT nested properly");
goto L;
}
else if(contents[x-y]=='(')
{
contents[x-y]='0';
contents[x]='0';
y=top;
}
else break;
}
}
else if(contents[x]=='}')
{
for(y=1;y<top;++y)
{
if(x-y==0)
{
printf("Parentheses/braces are NOT nested properly");
goto L;
}
else if(contents[x-y]=='{')
{
contents[x-y]='0';
contents[x]='0';
y=top;
}
else break;
}
}
}
printf("Parentheses/braces are nested properly");
}
else printf("Parentheses/braces are NOT nested properly");
L:
return 0;
}