package com.ys.datastructure;
public class MyStack {
    private int[] array;
    private int maxSize;
    private int top;
    public MyStack(int size){
        this.maxSize = size;
        array = new int[size];
        top = -1;
    }
    //壓入數(shù)據(jù)
    public void push(int value){
        if(top < maxSize-1){
            array[++top] = value;
        }
    }
    //彈出棧頂數(shù)據(jù)
    public int pop(){
        return array[top--];
    }
    //訪問棧頂數(shù)據(jù)
    public int peek(){
        return array[top];
    }
    //判斷棧是否為空
    public boolean isEmpty(){
        return (top == -1);
    }
    //判斷棧是否滿了
    public boolean isFull(){
        return (top == maxSize-1);
    }
}

package com.ys.test;
import com.ys.datastructure.MyStack;
public class MyStackTest {
    public static void main(String[] args) {
        MyStack stack = new MyStack(3);
        stack.push(1);
        stack.push(2);
        stack.push(3);
        System.out.println(stack.peek());
        while(!stack.isEmpty()){
            System.out.println(stack.pop());
        }
    }
}

package com.ys.datastructure;
import java.util.Arrays;
import java.util.EmptyStackException;
public class ArrayStack {
    //存儲(chǔ)元素的數(shù)組,聲明為Object類型能存儲(chǔ)任意類型的數(shù)據(jù)
    private Object[] elementData;
    //指向棧頂?shù)闹羔?
    private int top;
    //棧的總?cè)萘?
    private int size;
    //默認(rèn)構(gòu)造一個(gè)容量為10的棧
    public ArrayStack(){
        this.elementData = new Object[10];
        this.top = -1;
        this.size = 10;
    }
    public ArrayStack(int initialCapacity){
        if(initialCapacity < 0){
            throw new IllegalArgumentException("棧初始容量不能小于0: "+initialCapacity);
        }
        this.elementData = new Object[initialCapacity];
        this.top = -1;
        this.size = initialCapacity;
    }
    //壓入元素
    public Object push(Object item){
        //是否需要擴(kuò)容
        isGrow(top+1);
        elementData[++top] = item;
        return item;
    }
    //彈出棧頂元素
    public Object pop(){
        Object obj = peek();
        remove(top);
        return obj;
    }
    //獲取棧頂元素
    public Object peek(){
        if(top == -1){
            throw new EmptyStackException();
        }
        return elementData[top];
    }
    //判斷棧是否為空
    public boolean isEmpty(){
        return (top == -1);
    }
    //刪除棧頂元素
    public void remove(int top){
        //棧頂元素置為null
        elementData[top] = null;
        this.top--;
    }
    /**
     * 是否需要擴(kuò)容，如果需要，則擴(kuò)大一倍并返回true，不需要?jiǎng)t返回false
     * @param minCapacity
     * @return
     */
    public boolean isGrow(int minCapacity){
        int oldCapacity = size;
        //如果當(dāng)前元素壓入棧之后總?cè)萘看笥谇懊娑x的容量，則需要擴(kuò)容
        if(minCapacity >= oldCapacity){
            //定義擴(kuò)大之后棧的總?cè)萘?
            int newCapacity = 0;
            //棧容量擴(kuò)大兩倍(左移一位)看是否超過int類型所表示的最大范圍
            if((oldCapacity<<1) - Integer.MAX_VALUE >0){
                newCapacity = Integer.MAX_VALUE;
            }else{
                newCapacity = (oldCapacity<<1);//左移一位，相當(dāng)于*2
            }
            this.size = newCapacity;
            int[] newArray = new int[size];
            elementData = Arrays.copyOf(elementData, size);
            return true;
        }else{
            return false;
        }
    }
}

//測(cè)試自定義棧類 ArrayStack
//創(chuàng)建容量為3的棧，然后添加4個(gè)元素，3個(gè)int，1個(gè)String.
@Test
public void testArrayStack(){
    ArrayStack stack = new ArrayStack(3);
    stack.push(1);
    //System.out.println(stack.peek());
    stack.push(2);
    stack.push(3);
    stack.push("abc");
    System.out.println(stack.peek());
    stack.pop();
    stack.pop();
    stack.pop();
    System.out.println(stack.peek());
}v

//進(jìn)行字符串反轉(zhuǎn)
@Test
public void testStringReversal(){
    ArrayStack stack = new ArrayStack();
    String str = "how are you";
    char[] cha = str.toCharArray();
    for(char c : cha){
        stack.push(c);
    }
    while(!stack.isEmpty()){
        System.out.print(stack.pop());
    }
}

//分隔符匹配
//遇到左邊分隔符了就push進(jìn)棧，遇到右邊分隔符了就pop出棧，看出棧的分隔符是否和這個(gè)有分隔符匹配
@Test
public void testMatch(){
    ArrayStack stack = new ArrayStack(3);
    String str = "12<a[b{c}]>";
    char[] cha = str.toCharArray();
    for(char c : cha){
        switch (c) {
        case '{':
        case '[':
        case '<':
            stack.push(c);
            break;
        case '}':
        case ']':
        case '>':
            if(!stack.isEmpty()){
                char ch = stack.pop().toString().toCharArray()[0];
                if(c=='}' && ch != '{'
                    || c==']' && ch != '['
                    || c==')' && ch != '('){
                    System.out.println("Error:"+ch+"-"+c);
                }
            }
            break;
        default:
            break;
        }
    }
}