数据结构之栈的实现

栈是一种先进后出的数据结构检简称FILO

接下来我们将会用c++、java进行实现

下面我们就看看是怎样用c++代码实现

#include <iostream>
using namespace std;

typedef int datatype;
typedef struct node{
    datatype data;
    struct node *next; //结点的指针域
}StackNode,*LinkStack;

StackNode *p,*q;
LinkStack top;
datatype x;

void push(LinkStack& top,datatype x);
void pop();
void getTop(LinkStack top,datatype& x);
void getTop1();

int main(int argc, const char * argv[]) {
    // insert code here...
    cout << "Hello, World!\n";
    cout << "the top of the stack is "<< x <<endl;
    push(top,2);
    getTop(top,x);
    cout<<"xx "<<x<<" xx"<<endl;
    return 0;
}
//入栈
void push(LinkStack& top,datatype x){
    StackNode *p;
    p = new StackNode;
    p->data =x;
    p->next =top;
    top=p;
}
//出栈
void pop(){
    if(top == NULL){
        cout<< "underflow";
    }else{
        StackNode *p=top;
        x=top->data;
        top = top->next;
        delete p;
    }
}
//读取链栈的栈顶元素
void getTop(LinkStack top,datatype& x){
    if(top == NULL){
        cout << "error";
    }else{
        x= top->data;
    }
}

java实现

public interface IStack<E,T> {

    /**
     * 入栈
     * @param data 入栈的内容
     */
    public void push(T data);

    /**
     * 出栈
     */
    public void pop();

    /**
     * 获取顶层元素
     * @return
     */
    public T getTop();

}

public class Stack<T> implements IStack<Stack.Node<T>, T> {

    private Node<T> top;

    @Override
    public void push(T data) {

        Node<T> newNode = new Node<>();
        newNode.data = data;
        newNode.next = top;
        top = newNode;
    }

    @Override
    public void pop() {

        if (top == null) {
            return;
        }
        Node temp = top;
        top = top.next;
        temp.next = null;
        temp = null;
    }

    @Override
    public T getTop() {

        if (top == null) {
            return null;
        }

        return top.data;
    }


    static class Node<T> {
        public T data;
        public Node<T> next;
    }
}

测试

    public static void main(String[] args) {
        System.out.println("hahaha");

        Stack<Integer> stack = new Stack<>();

        stack.push(100);
        System.out.println(stack.getTop());
    }