1.利用栈的基本操作
代码实现如下
#ifndef _SEQSTACK_H
#define _SEQSTACK_H
#include<iostream>
#include<assert.h>
using namespace std;
typedef int ElemType;
#define STACK_INIT_SIZE 20
typedef struct Stack
{
ElemType *base;
int top;
int capacity;
}Stack;
void ConverSeq(int n);
bool IsFull(Stack *st);
bool IsEmpty(Stack *st);
void InitStack(Stack *st);
bool Push(Stack *st, ElemType x);
bool Pop(Stack *st, ElemType *v);
bool Pop(Stack *st);
#endif
bool IsFull(Stack *st)
{
return st->top >= st->capacity;
}
bool IsEmpty(Stack *st)
{
return st->top =&