数组模拟栈，链表模拟栈_java实现

栈

• 栈的英文为(stack)
• 栈是一个先入后出(FILO-First In Last Out)的有序列表。
• 栈(stack)是限制线性表中元素的插入和删除只能在线性表的同一端进行的一种特殊线性表。允许插入和删除的一端，为变化的一端，称为栈顶(Top)，另一端为固定的一端，称为栈底(Bottom)。
• 根据栈的定义可知，最先放入栈中元素在栈底，最后放入的元素在栈顶，而删除元素刚好相反，最后放入的元素最先删除，最先放入的元素最后删除

应用场景

• 子程序的调用:在跳往子程序前，会先将下个指令的地址存到堆栈中，直到子程序执行完后再将地址取出，以回到原来的程序中。
• 处理递归调用:和子程序的调用类似，只是除了储存下一个指令的地址外，也将参数、区域变量等数据存入堆栈中。
• 表达式的转换与求值(实际解决)。
• 二叉树的遍历。
• 图形的深度优先(depth—first)搜索法。

[外链图片转存失败,源站可能有防盗链机制,建议将图片保存下来直接上传(img-LDtJXfvP-1620311536954)(数据结构.assets/image-20210504114511953.png)]

数组模拟栈

思路分析：

1.使用数组来模拟栈
2.定义一个top来表示栈顶，初始化为-1
3.入栈的操作，当有数据加入到栈时，top++; stack[top]= data;
4.出栈的操作，int value = stack[top]; top–,return value；

代码部分

package com.zhangan.stack;

import java.util.Scanner;

//表示一个栈
class ArrayStack {

    private int maxSize;//栈的大小
    private int[] stack;//数组模拟栈
    private int top = -1;//栈顶 初始化为-1

    public ArrayStack(int maxSize) {
        this.maxSize = maxSize;
        stack = new int[maxSize];
    }

    //栈满
    public boolean isFull() {
        return top == maxSize - 1;
    }

    //栈空
    public boolean isEmpty() {
        return top == -1;
    }

    //入栈
    public void push(int value) {
        //判断是否栈满
        if (isFull()) {
            System.out.println("栈满");
            return;
        }
        top++;
        stack[top] = value;
    }

    //出栈
    public int pop() {
        if (isEmpty()) {
            throw new RuntimeException("栈空");
        }

        int value = stack[top];
        top--;
        return value;
    }

    //遍历栈
    public void list() {

        if (isEmpty()) {
            throw new RuntimeException("栈空");
        }

        for (int i = top; i >= 0; i--) {
            System.out.println("stack[" + i + "]=" + stack[i]);
        }
    }


}


public class ArrayStackDemo {

    public static void main(String[] args) {

        ArrayStack stack = new ArrayStack(4);
        String key = "";
        boolean loop = true;//是否退出菜单
        Scanner scanner = new Scanner(System.in);

        while (loop) {
            System.out.println("-------------");
            System.out.println("show:显示栈");
            System.out.println("push:入栈");
            System.out.println("pop: 出栈");
            System.out.println("exit:退出程序");
            System.out.println("请输入你的选择");
            System.out.println("-------------");
            key = scanner.next();
            switch (key) {

                case "show":
                    try {
                        stack.list();
                    } catch (Exception e) {
                        System.out.println(e.getMessage());
                    }
                    break;
                case "push":
                    System.out.println("输入要添加的数据");
                    int value = scanner.nextInt();
                    stack.push(value);
                    break;
                case "pop":
                    try {
                        int pop = stack.pop();
                        System.out.println("出栈的数据：" + pop);
                    } catch (Exception e) {
                        System.out.println(e.getMessage());
                    }
                    break;
                case "exit":
                    scanner.close();
                    loop = false;
                    break;
                default:
                    break;
            }
        }

        System.out.println("退出程序");

    }
}

链表模拟栈

代码部分

package com.zhangan.stack;


import java.util.Scanner;

//节点
class Node {

    private String headValue;
    private int value;
    private Node next;

    public Node(int value) {
        this.value = value;
    }
    
        public Node(String headValue) {
        this.headValue = headValue;
    }

    @Override
    public String toString() {
        return "Node{" +
                "value=" + value +
                '}';
    }

    public int getValue() {
        return value;
    }

    public void setValue(int value) {
        this.value = value;
    }

    public Node getNext() {
        return next;
    }

    public void setNext(Node next) {
        this.next = next;
    }
}


//链表模拟栈
class LinkedStack {

    private int maxSize;//栈容量
    private int pop = -1;

    public LinkedStack(int maxSize) {
        this.maxSize = maxSize;
    }

    private Node head = new Node("");


    public Node getHead() {
        return head;
    }

    //栈满
    public boolean isFull() {
        return pop == maxSize - 1;
    }

    //栈空
    public boolean isEmpty() {
        return pop == -1;
    }

    //遍历栈大小
    public int size() {
        int count = 0;

        Node temp = head.getNext();
        while (temp != null) {
            temp = temp.getNext();
            count++;
        }
        return count;
    }

    //遍历栈
    public void list() {

        if (isEmpty()) {
            throw new RuntimeException("栈空");
        }
        Node temp = head;
        for (int i = size() - 1; i >= 0; i--) {
            temp = temp.getNext();
            System.out.println("栈[" + i + "]" + temp.getValue());

        }
    }

    //入栈
    public void push(int value) {
        //判断是否栈满
        if (isFull()) {
            System.out.println("栈满");
            return;
        }

        Node node = new Node(value);
        node.setNext(head.getNext());
        head.setNext(node);
        pop++;
    }

    //出栈
    public int pop() {
        if (isEmpty()) {
            throw new RuntimeException("栈空");
        }

        int value = head.getNext().getValue();
        head.setNext(head.getNext().getNext());
        pop--;

        return value;
    }

}

public class ceshiceshi {

    public static void main(String[] args) {

        LinkedStack stack = new LinkedStack(4);
        String key = "";
        boolean loop = true;//是否退出菜单
        Scanner scanner = new Scanner(System.in);

        while (loop) {
            System.out.println("-------------");
            System.out.println("show:显示栈");
            System.out.println("push:入栈");
            System.out.println("pop: 出栈");
            System.out.println("exit:退出程序");
            System.out.println("请输入你的选择");
            System.out.println("-------------");
            key = scanner.next();
            switch (key) {

                case "show":
                    try {
                        stack.list();

                    } catch (Exception e) {
                        System.out.println(e.getMessage());
                    }
                    break;
                case "push":
                    System.out.println("输入要添加的数据");
                    int value = scanner.nextInt();
                    stack.push(value);
                    break;
                case "pop":
                    try {
                        int pop = stack.pop();
                        System.out.println("出栈的数据：" + pop);
                    } catch (Exception e) {
                        System.out.println(e.getMessage());
                    }
                    break;
                case "exit":
                    scanner.close();
                    loop = false;
                    break;
                default:
                    break;
            }
        }

        System.out.println("退出程序");

    }
}