一.数组实现的栈,能存储任意类型的数据。
import java.lang.reflect.Array;
public class ArrayStack<T> {
private final static int DEFAULT_SIZE = 10;
private T[] mArray;
private int top;
private int count;
public ArrayStack(Class<T> type) {
this(type, DEFAULT_SIZE);
}
public ArrayStack(Class<T> type, int size) {
[链接](https://blog.csdn.net/e421083458/article/details/8839311)
mArray = (T[])Array.newInstance(type, DEFAULT_SIZE);
count = 0;
top = -1;
}
public void push(T data) {
mArray[++top] = data;
count++;
}
public boolean isEmpty() {
return top == -1;
}
public boolean isFull() {
return count == DEFAULT_SIZE;
}
public T pop() {
T m = mArray[top];
top--; count--;
return m;
}
public T peek() {
return mArray[count-1];
}
public void print() {
if(!isEmpty()) {
for(int i = 0; i <= top; i++) {
System.out.println(mArray[i]);
}
}
System.out.println("count="+count);
}
public static void main(String[] args) {
ArrayStack<String> stack = new ArrayStack<String>(String.class);
System.out.println("依次进栈:");
stack.push("10");
stack.push("20");
stack.push("30");
stack.print();
System.out.println("栈顶元素为:"+stack.peek());
System.out.println("isEmpty:"+stack.isEmpty());
System.out.println("isFull:"+stack.isFull());
System.out.println("\n"+"依次出栈:");
System.out.println(stack.pop());
System.out.println(stack.pop());
System.out.println(stack.pop());
stack.print();
System.out.println("isEmpty:"+stack.isEmpty());
System.out.println("isFull:"+stack.isFull());
}
}
二.java的Collection中的stack演示。
import java.util.Stack;
public class CollectionStack {
public static void main(String[] args) {
Stack<String> stack = new Stack<String>();
stack.push("100");
stack.push("200");
stack.push("300");
System.out.println("1栈顶元素为:"+stack.peek());
System.out.println("2栈顶元素为:"+stack.pop());
System.out.println("栈中元素个数:"+stack.size());
stack.push("400");
System.out.println("依次出栈:");
while(!stack.isEmpty()) {
System.out.println(stack.pop());
}
System.out.println("栈中元素个数:"+stack.size());
}
}
学习自:http://www.cnblogs.com/skywang12345/p/3562239.html