5 线性表-栈-链式存储

头大……

栈是一种功能受限的线性表

1、基本功能实现

#include<stdio.h>
#include<stdlib.h>
#include<iostream>
using namespace std;
#define TRUE 1
#define FALSE 0
#define OK 1
#define ERROR 0
#define OVERFLOW -2
#define STACK_INIT_SIZE 100//存储空间的初始分配量
#define STACKINCREMENT 10//存储空间分配增量

typedef int Status;
typedef int Selemtype;
typedef struct node
{
    int data;
    struct node *next;
} Stack;


Status IsEmpty(Stack *s)
{
    if(s->next==NULL)
    {
        return TRUE;
    }
    return FALSE;
}
void InitStack(Stack *s)
{
    s->next=NULL;//将栈顶设为空
}
int Push(Stack *s,Selemtype e)
{
    //创造新的节点 存放传入的e
    Stack *p;
    p=(Stack*)malloc(sizeof(Stack));
    if(p==NULL)
    {
        return 0;
    }
    p->data=e;
    p->next=s->next;
    s->next=p;
    return OK;
}
Status Pop(Stack *top,Selemtype &e)
{
    if(IsEmpty(top)) return 0;
    Stack *p;
    p=top->next;//栈顶下面第一个节点是要出栈的
    e=p->data;
    top->next=p->next;//栈内元素的前移
    free(p);
    return OK;
}
void travelStack(Stack *s)
{
    Stack *p=s->next;
     printf("the elemet in the stack:
");
    while(p)
    {
        printf("%d ",p->data);
        p=p->next;
    }
}
int StackLength(Stack *s)
{
    Stack *p=s->next;
    int countt=0;
    while(p)
    {
        countt++;
        p=p->next;
    }
    return countt;
}
void ClearStack(Stack *s)
{
    int x;
    while(Pop(s,x))
    {
        printf("%d ",x);
    }
    cout<<endl;
    free(s);
}


int main()
{
    int a;
    Stack *top=(Stack*)malloc(sizeof(Stack));//生成一个栈顶指针
    InitStack(top);
    int c=5;
    while(c--)
    {
        cin>>a;
        Push(top,a);
    }
    travelStack(top);
    cout<<endl;

    int x;
    Pop(top,x);
    cout<<"The ele that you delete is "<<x<<" ."<<endl;
    x=StackLength(top);
    cout<<x;
    cout<<endl;
    cout<<"Now pop all the data and clear the stack:"<<endl;
    ClearStack(top);
    return 0;
}