Java数据结构——栈的方法与模拟实现_java在堆上面模拟栈

最新推荐文章于 2024-10-01 18:51:18 发布

2401_84181309

最新推荐文章于 2024-10-01 18:51:18 发布

阅读量228

点赞数 3

文章标签： java 数据结构开发语言

本文链接：https://blog.csdn.net/2401_84181309/article/details/138235839

版权

public static void main(String[] args) {
        Stack<Integer> stack = new Stack<>();
        stack.add(12);
        stack.add(23);
        stack.add(34);
        int x = stack.pop();
        System.out.println("x = "+x);
        int y = stack.pop();
        System.out.println("y = "+y);
    }

可以看出栈的先进后出的特点

peek

peek方法是指只获得栈顶元素，不删除

 public static void main(String[] args) {
        Stack<Integer> stack = new Stack<>();
        stack.add(12);
        stack.add(23);
        stack.add(34);
        int x = stack.pop();
        System.out.println("x = "+x);
        int y = stack.pop();
        System.out.println("y = "+y);
        System.out.println("===========");
        int z = stack.peek();
        System.out.println("z = "+z);
        System.out.println("===========");
        System.out.println("stack = "+stack);
    }

empty

判断栈是否为空

public static void main(String[] args) {
        Stack<Integer> stack = new Stack<>();
        stack.add(12);
        stack.add(23);
        stack.add(34);
        int x = stack.pop();
        System.out.println("x = "+x);
        int y = stack.pop();
        System.out.println("y = "+y);
        System.out.println("===========");
        int z = stack.peek();
        System.out.println("z = "+z);
        System.out.println("===========");
        System.out.println("stack = "+stack);
        System.out.println("===========");
        boolean n = stack.empty();
        System.out.println(n);
    }

3.用数组实现栈

创建一个栈

class MyStack{
    public int[] elem;
    public int usedSize;
    public static final int DEFAULT_SIZE = 10;

    public MyStack(){
        this.elem = new int[DEFAULT_SIZE];
    }
}

实现push方法

需要判断栈是否满了，如果满了需要扩容之后再进行压栈

 public int push(int val){
        if(isFull()){
            elem = Arrays.copyOf(elem,2*elem.length);
        }
        elem[usedSize] = val;
        usedSize++;
        return val;
    }
    public boolean isFull(){
        return usedSize == elem.length;
    }

实现pop方法

先判断栈是否为空，不为空，直接返回usedSize-1下标的值，并且usedSize–；

public int pop(){
        if(empty()){
            throw new StackEmptyException("栈为空");
        }
        return elem[--usedSize];
    }
    public boolean empty(){
        return usedSize == 0;
    }

实现peek方法

先判断是否为空，不为空返回usedSize-1下标的值

public int peek(){
        if(empty()){
            throw new StackEmptyException("栈为空");
        }
        return elem[usedSize-1];
    }

我们知道pop是栈顶元素出栈，peek只是得到栈顶元素，不改变栈

两个返回值的差异

pop之后usedSize本身的大小会减小，改变了栈

peek中usedSize本身并不改变，因此不会改变栈

测试

public static void main(String[] args) {
        MyStack myStack = new MyStack();
        myStack.push(1);
        myStack.push(2);
        myStack.push(3);
        int x = myStack.pop();
        System.out.println("X = "+x);
        int y = myStack.peek();
        System.out.println("y = "+y);
        int x1 = myStack.peek();
        System.out.println("x1 = "+x1);
        int y1 = myStack.peek();
        System.out.println("y1 = "+y1);

    }