先进后出

比较经典的一个题目

代码如下：

package Day06;
public class StackOfIntegers {
public static final int DEFAULT_CAPACITY = 16;
private int[] elements;
private int size; /**
* @param size
*/
public StackOfIntegers(int size) {
this.elements = new int[size];
} public StackOfIntegers() {
this.elements = new int[DEFAULT_CAPACITY];
} public void push(int value) {
if (elements.length <= size) {
int[] temp = new int[elements.length * 2];
System.arraycopy(elements, 0, temp, 0, elements.length);
elements = temp;
}
elements[size++] = value;
}

public int pop() {
return elements[--size];
}

public boolean isEmpty() {
return size == 0;
} /**
* @return the size
*/
public int getSize() {
return this.size;
}

}
第二部分
package Day06;

public class TestStackOfIntegers {
public static void main (String[] args) {
StackOfIntegers stack = new StackOfIntegers();
for (int i = 0; i < 10; i++)
stack.push(i);
while (!stack.isEmpty()) {
System.out.println(stack.pop() + " ");
}
}
}