数据结构之栈 C++实现

栈的最重要的一点就是栈的插入和删除运算仅在栈顶一端进行，后进栈的元素必定先出栈，所以又把栈称为后进先出表。

功能实现
1.实现入栈功能
使用链表实现栈。

#include "iostream"

using namespace std;

typedef struct student{
    int data;
    student *next;
    student(int x) :data(x), next(NULL){}
}Node;

struct Stack{
    Node *top, *bottom;
    Stack() :top(NULL), bottom(NULL){}
};

/*
入栈
*/
Stack* push(Stack *S,int x){
    Node *temp;
    temp = (Node*)malloc(sizeof(Node));
    temp->data = x;
    temp->next = NULL;
    if (S->bottom == NULL){
        S->bottom = temp;
        S->top = temp;
    }
    else{
        S->top->next = temp;
        S->top = temp;
    }
    return S;
}

int main(){
    Stack *s = new Stack;
    push(s,1);
    push(s,2);
    push(s, 3);
    cout << s->top->data << endl;
    cout << s->bottom->data << endl;

    delete s;
    system("pause");
    return 0;
}

现象如下图所示：

2.实现出栈功能
思路：
(1)若栈底是空的，则直接返回空栈；
(2)否则，若栈底与栈顶相等，出栈后，栈底和栈顶都为空；
(3)若栈底和栈顶不相等，则保存栈顶的前一个节点，使栈顶指向它，原栈顶赋为空。

代码如下：

“`
/*
出栈
*/
Stack* pop(Stack *S){
Node *temp;
if (S->bottom == NULL){
cout << “NULL Stack” << endl;
return NULL;
}
else{
temp = S->bottom;
if (S->bottom == S->top){
S->bottom = NULL;
S->top = NULL;
}
else{
while (temp->next != S->top){//将栈顶的前一个保存在temp中
temp = temp->next;
}
S->top = temp;
S->top->next = NULL;
}
}
return S;
}

int main(){
Stack *s = new Stack;
//入栈
cout << “push:” << endl;
push(s,1);
push(s,2);
push(s, 3);
cout <<”Bottom is “<< s->bottom->data << endl;
cout <<”Top is “<< s->top->data << endl;

cout << endl;

//出栈
cout << "pop:" << endl;
    cout << "Bottom is " << ((s->bottom == NULL) ? NULL : s->bottom->data) << endl;
cout << "Top is " << ((s->top == NULL) ? NULL : s->top->data) << endl;
pop(s);

//出栈
cout << "pop:" << endl;
cout << "Bottom is " << ((s->bottom == NULL) ? NULL : s->bottom->data) << endl;
cout << "Top is " << ((s->top == NULL) ? NULL : s->top->data) << endl;
pop(s);

//出栈
cout << "pop:" << endl;
cout << "Bottom is " << ((s->bottom == NULL) ? NULL : s->bottom->data) << endl;
cout << "Top is " << ((s->top == NULL) ? NULL : s->top->data) << endl;
pop(s);

//出栈
cout << "pop:" << endl;
cout << "Bottom is " << ((s->bottom == NULL) ? NULL : s->bottom->data) << endl;
cout << "Top is " << ((s->top == NULL) ? NULL : s->top->data) << endl;
pop(s);

delete s;
system("pause");
return 0;

}

现象如下图所示：