Algs4-1.3定容字符串栈

public class FixedCapacityStackOfStrings
{
    private String[] a;
    private int N;
    public FixedCapacityStackOfStrings(int cap)
    {a=new String[cap];}
   
    public void push(String item)
    {a[N++]=item;}
   
    public String pop()
    {return a[--N];}
   
    public boolean isEmpty()
    {return N==0;}
   
    public int size()
    {return N;}
   
    public static void main(String[] args)
    {
        FixedCapacityStackOfStrings s;
        s=new FixedCapacityStackOfStrings(100);
        while (!StdIn.isEmpty())
        {
            String item=StdIn.readString();
            if(!item.equals("-"))
                s.push(item);
            else if(!s.isEmpty())
                StdOut.printf(s.pop()+" ");
        }//end while
        StdOut.println("("+s.size()+" left on stack)");
    }//end main
}//end class

转载于:https://www.cnblogs.com/longjin2018/p/9849250.html