//定容字符串栈
package com.runoob.test;
public class FixedCapacityStackOfString<Item> {
private Item[] a;
private int N;
public FixedCapacityStackOfString(int cap) {
a=(Item[]) new Object[cap];
}
public void push(Item item) {
a[N++]=item;
}
public Item pop() {
return a[--N];
}
public boolean isEmpty() {
return N==0;
}
public int size() {
return N;
}
}
//定容泛型栈的实现
package com.runoob.test;public class FixedCapacityStackOfString {private String[] a;private int N;public FixedCapacityStackOfString(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;}}