基于链表的栈
由于链表的addFirst()和removeFirst()的时间复杂度都为O(1),所以可以以链表头为栈顶,基于链表封装栈结构。
基于链表实现的栈源码如下:
package stack;
import linkedList.LinkedList;
public class LinkedListStack<E> implements Stack<E> {
private LinkedList<E> list;
public LinkedListStack(){
list = new LinkedList<>();
}
@Override
public int getSize() {
return list.getSize();
}
@Override
public boolean isEmpty() {
return list.isEmpty();
}
@Override
public E peek() {
return list.getFirst();
}
@Override
public void push(E e) {
list.addFirst(e);
}
@Override
public E pop() {
return list.removeFirst();
}
@Override
public String toString() {
StringBuilder res = new StringBuilder();
res.append("Stack: top ");
res.append(list);
return res.toString();
}
}