Java資料結構之——棧:用連結串列實現
阿新 • • 發佈:2019-01-13
class Node<E>{ E data; Node<E> next = null; public Node(E data){ this.data = data; } } public class ListStack<E>{ Node<E> top = null; public boolean empty(){ return top == null; } //頭插法插入新節點,實現入棧 public void push(E data){ Node<E> newNode = new Node<E>(data); newNode.next = top; top = newNode; } public E pop(){ if(this.empty()){ return null; } E data = top.data; top = top.next; return data; } public E peek(){ if(empty()) return null; return top.data; } }