数组和链表模拟栈。

数组模拟栈

package com.yhc.stack;

import java.util.Scanner;

public class ArrayStack {
    public static void main(String[] args) {
        Array array = new Array(4);
        String key = "";
        Scanner scanner = new Scanner(System.in);
        Boolean loop = true;
        while(loop){
            System.out.println("show: 表示显示栈");
            System.out.println("exit: 退出程序");
            System.out.println("push: 表示添加数据到栈(入栈)");
            System.out.println("pop: 表示从栈取出数据(出栈)");
            System.out.println("请输入你的选择");
            key = scanner.next();
            switch (key){
                case "show" :
                    array.list();
                    break;
                case "exit" :
                    scanner.close();
                    loop = false;
                    break;
                case "push" :
                    System.out.println("请输入要添加的数据！：");
                    int value = scanner.nextInt();
                    array.push(value);
                    break;
                case "pop" :
                    try {
                        int res = array.pop();
                        System.out.println("弹出的数据是 ： " + res);
                    }catch (Exception e){
                        System.out.println(e.getMessage());
                    }
                    break;
                default:
                    break;
            }
        }
        System.out.println("程序退出！");
    }
}


//数组模拟栈
class Array{
    private int maxSize;
    private int[] stack;
    private int top =-1;
    //构造器

    public Array() {
    }

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

    //栈满
    public boolean isFull(){
        return top == maxSize;
    }
    //栈空
    private boolean isEmpty(){
        return top == -1;
    }
    //入栈
    public void push(int num){
        //先判断是否可以添加，是否栈满
        if(isFull()){
            System.out.println("栈满，不能添加！");
        }
        top++;
        stack[top] = num;
    }
    //出栈
    public int pop(){
        //判断是否为空
        if(isEmpty()){
            throw new RuntimeException("栈已空，不能出栈");
        }
        int value = stack[top];
        top--;
        return value;
    }
    //显示
    public void list(){
        //判断是否为空
        if(isEmpty()){
            System.out.println("栈空！");
        }
        for (int i = top; i >= 0 ; i--) {
            System.out.println("stack["+i+"] = " + stack[i]);
        }
    }

}

链表模拟栈、

package com.yhc.stack;

import java.util.Scanner;

public class SingleArray {
    public static void main(String[] args) {
        single single = new single();
        String key = "";
        Scanner scanner = new Scanner(System.in);
        Boolean loop = true;
        while(loop){
            System.out.println("show: 表示显示栈");
            System.out.println("exit: 退出程序");
            System.out.println("push: 表示添加数据到栈(入栈)");
            System.out.println("pop: 表示从栈取出数据(出栈)");
            System.out.println("请输入你的选择");
            key = scanner.next();
            switch (key){
                case "show" :
                    single.list();
                    break;
                case "exit" :
                    scanner.close();
                    loop = false;
                    break;
                case "push" :
                    System.out.println("请输入要添加的数据！：");
                    int value = scanner.nextInt();
                    Node node = new Node(value);
                    single.push(node);
                    break;
                case "pop" :
                    single.pop();
                    break;
                default:
                    break;
            }
        }
        System.out.println("程序退出！");
    }

    }

class single{

    Node head = new Node(0);
    Node temp = head;
    //栈空
    public boolean isEmpty(){
        return head.next == null;
    }
    //入栈,最后面
    public void push(Node node){

        while(true){
           if(temp.next == null){
                break;
           }
           temp = temp.next;
       }
        temp.next = node;
    }
    //出栈  有问题，待改进
    public void pop(){
        if(isEmpty()){
            System.out.println("链表为空，不能弹出！");
            return ;
        }
        //找到最后
        Node pre = head;
        Node cur = head.next;
        while(true){
            if(cur.next == null){
                break;
            }
            pre.next = cur;
            cur = cur.next;
        }
        System.out.println(cur);
        pre.next = null;
    }

    //显示
    public void list(){
        if(isEmpty()){
            System.out.println("链表为空，不能输出！");
            return;
        }
        Node temp1 = head;
        while(true){
            if(temp1.next == null){
                break;
            }
            System.out.println(temp1.next);
            temp1 = temp1.next;
        }
    }
}
class Node{
    //如果设置成private ，就要生成get 和 set 方法。
    public int no;
    public Node next;

    public Node(int no) {
        this.no = no;
    }

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