使用数组实现栈

梦里梦外; 2023-07-16 12:56 16阅读 0赞

import java.util.Arrays;

public class myStack  
\{

private int[] storage;// 存放栈中元素的数组
    
    private int count;// 栈中元素数量
    
    private int capacity; // 栈的容量
    
    private static final int GROW_FACTOR = 2;
    
    // 不带初始量的构造函数。默认容量为8
    private myStack()
    {
        this.count = 0;
        this.capacity = 8;
        this.storage = new int[8];
    }
    
    // 有参构造方法
    private myStack(int initcap)
    {
        this.count = 0;
        this.capacity = initcap;
        this.storage = new int[initcap];
    }
    
    // 确保容量大小
    private void ensureCap()
    {
        int newcap = capacity * GROW_FACTOR;
        storage = Arrays.copyOf(storage, newcap);
        capacity = newcap;
    }
    
    // push 入栈
    private void push(int value)
    {
        if (count == capacity)
        {
            ensureCap();
        }
        storage[count++ ] = value;
    }
    // pop 返回栈顶元素然后出栈
    
    private int pop()
    {
        if (count == 0)
        {
            throw new IllegalArgumentException("Stack is empty");
        }
        count-- ;// 出栈
        return storage[count];
    }
    
    // peek 返回栈顶元素不出栈
    private int peek()
    {
        if (count == 0)
        {
            throw new IllegalArgumentException("Stack is empty");
        }
        return storage[count - 1];
    }
    
    // 判断栈是否为空
    private boolean isEmpty()
    {
        return count == 0;
    }
    
    // 返回栈中元素的个数
    private int size()
    {
        return count;
    }
    
    public static void test()
    {
        myStack myStack = new myStack(3);
        myStack.push(1);
        myStack.push(2);
        myStack.push(3);
        myStack.push(4);
        myStack.push(5);
        myStack.push(6);
        myStack.push(7);
        myStack.push(8);
        System.out.println(myStack.peek());// 8
        System.out.println(myStack.size());// 8
        for (int i = 0; i < 8; i++ )
        {
            System.out.println(myStack.pop());
        }
        System.out.println(myStack.isEmpty());// true
        myStack.pop();
    }
    
    public static void main(String[] args)
    {
        test();
    }

--------------------

![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3dlaXhpbl80MjcxNDYwNQ_size_16_color_FFFFFF_t_70]

[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3dlaXhpbl80MjcxNDYwNQ_size_16_color_FFFFFF_t_70]: /images/20230528/cadcb033291544b7a3cf05a3e7675bda.png