本文实例讲述了Java使用Deque实现堆栈的方法。分享给大家供大家参考。具体如下:
import java.util.ArrayDeque;
import java.util.Deque;
public class IntegerStack {
private Deque data = new ArrayDeque();
public void push(Integer element) {
data.addFirst(element);
}
public Integer pop() {
return data.removeFirst();
}
public Integer peek() {
return data.peekFirst();
}
public String toString() {
return data.toString();
}
public static void main(String[] args) {
IntegerStack stack = new IntegerStack();
for (int i = 0; i < 5; i++) {
stack.push(i);
}
System.out.println("After pushing 5 elements: " + stack);
int m = stack.pop();
System.out.println("Popped element = " + m);
System.out.println("After popping 1 element : " + stack);
int n = stack.peek();
System.out.println("Peeked element = " + n);
System.out.println("After peeking 1 element : " + stack);
}
}
希望本文所述对大家的java程序设计有所帮助。



