/**
 * Created by yywang on 2017/1/14.
 */
class stack{
    private String [] a;
    private int N;
    stack(int cap){
        a = new String[cap];
    }
    void push(String o){
        a[N] = o;
        N++;
    }
    String pop(){
        N--;
        return a[N];
    }
    boolean isEmpty(){
        return
 
 N==0;
    }

    int size(){
        return N;
    }

}

public class FixedCapaticyStackOfString {

}

上面實現的stack中的元素必須是String， 下面使用泛型程式設計，來擴大stack中可以容納的型別。

/**
 * Created by yywang on 2017/1/14.
 */
class stack<Item>{
    private Item [] a;
    private int N;
    stack(int cap){
        a = (Item [])new
 
 Object[cap];
    }
    void push(Item o){
        a[N] = o;
        N++;
    }
    Item pop(){
        N--;
        return a[N];
    }
    boolean isEmpty(){
        return N==0;
    }

    int size(){
        return N;
    }

}

public class FixedCapaticyStack {

}