//cl头文件
#pragma once
#define TRUE 1
#define FLASE 0
#define OK 1
#define ERROR 0
#define OVERFLOW -2
#include<string.h>
#include<ctype.h>
#include<malloc.h>
#include<limits.h>
#include<stdio.h>
#include<stdlib.h>
#include<io.h>
#include<math.h>
#include<process.h>
#include<iostream>
typedef int status;

#include"cl.h"
#define MAXSIZE 100
typedef int ElemType;
/*-----栈的顺序存储表示-----*/
typedef struct Stack
{ElemType stack[MAXSIZE];int top;
}Stack;
/*-----栈的初始化-----*/
void InitStack(Stack* S)
{S->top = -1;
}
/*-----栈的判空-----*/
void StackEmpty(Stack S)
{if (S.top == -1) {printf("栈为空\n");}else {printf("栈不空\n");}
}
/*-----入栈-----*/
void Push(Stack* S, ElemType e)
{if (S->top == MAXSIZE - 1) {printf("错误,栈已满\n");}else {S->top++;S->stack[S->top] = e;}
}
/*-----出栈-----*/
void Pop(Stack* S, ElemType* e)
{if (S->top == -1) {printf("错误,栈已满\n");}else {*e = S->stack[S->top];S->top--;}
}
/*-----栈的长度-----*/
void StackLength(Stack S)
{printf("栈的长度为%d\n", S.top + 1);
}
/*-----清空栈-----*/
void StackClear(Stack* S)
{S->top = -1;
}
/*-----打印栈中元素-----*/
void PrintStack(Stack* S)
{if (S->top == -1) {printf("空\n");}for (int i = S->top;i >= 0;i--) {printf("%d ", S->stack[i]);}printf("\n");
}
int main()
{Stack S;int choose, num, e;InitStack(&S);printf("栈已初始化\n");while (1) {printf("请输入想要进行的操作:\n");printf("-----------------------------------------\n");printf("\t1.    入栈\n");printf("-----------------------------------------\n");printf("\t2.    出栈\n");printf("-----------------------------------------\n");printf("\t3.    打印栈\n");printf("-----------------------------------------\n");printf("\t4.    清空栈\n");printf("-----------------------------------------\n");printf("\t5.    求栈的长度\n");printf("-----------------------------------------\n");printf("\t6.    判断栈是否为空\n");printf("-----------------------------------------\n");printf("\t0.    退出\n");printf("-----------------------------------------\n");int choose;scanf_s("%d", &choose);switch (choose) {case 1:printf("请输入入栈元素的个数:\n");scanf_s("%d", &num);printf("请输入入栈元素:\n");for (int i = 0;i <= num - 1;i++) {scanf_s("%d", &e);Push(&S, e);}printf("栈里面的元素现为:");PrintStack(&S);system("pause");system("cls");break;case 2:Pop(&S, &e);printf("栈顶元素为:%d\n", e);printf("栈里面的元素现为:");PrintStack(&S);system("pause");system("cls");break;case 3:printf("栈里面的元素现为:");PrintStack(&S);system("pause");system("cls");break;case 4:StackClear(&S);printf("栈已清空\n");system("pause");system("cls");break;case 5:StackLength(S);printf("栈里面的元素现为:");PrintStack(&S);system("pause");system("cls");break;case 6:StackEmpty(S);printf("栈里面的元素现为:");PrintStack(&S);system("pause");system("cls");break;case 0:return 0;system("pause");system("cls");break;}}
}