用Java代码实现栈数据结构的基本方法归纳

package Stack;
import Bag.LinearNode;
//为了重点来实现算法，将异常情况直接打印出然后退出程序，不再声明异常类
public class LinkedStack implements StackADT {
  private LinearNode top; //指向栈顶
  private int count;//标记栈的大小
  public static void main(String[] args){
    LinkedStack stack = new LinkedStack();
    System.out.println("将0到10依次压栈");
    for(int i = 0;i <10;i++)
      stack.push(i);
    System.out.println("连续执行5次出栈操作");
    for(int i = 0;i <5;i++)
      stack.pop();
    System.out.println("栈为空吗？： " + stack.isEmpty());
    System.out.println("栈的大小为： " + stack.size());
    System.out.println("栈顶元素为： " + stack.top.getElement());
    System.out.println("栈顶元素为： " + stack.peek());  
  }
  public LinkedStack()
  {
    top = null;
    count = 0;
  }
  public int size() {
    return count;
  }
  public boolean isEmpty() {
    return (size() == 0);
  }
  public void push(Object element) {
    LinearNode node = new LinearNode(element);
    node.setNext(top);
    top = node;
    count++;
  }
  public Object pop() {
    if(isEmpty())
    {
      System.out.println("stack is empty!");
      System.exit(1);
    }
    Object result = top.getElement();
    top = top.getNext();
    count--;
    return result;
  }
  public Object peek() {
    Object result = top.getElement();
    return result;
  }
}

private Object[] contents;
private int top;//top标记下一个入栈的位置，同时也表示栈的容量大小，跟链式实现的count比较一下！！！

package Stack;
public class ArrayStack implements StackADT {
  private Object[] contents;
  private int top;//top标记下一个入栈的位置，同时也表示栈的容量大小，跟链式实现的count比较一下！！！
  private static int SIZE = 10;
  public ArrayStack()
  {
    cOntents= new Object[SIZE];
    top = 0;
  }
  public void expand(){//借助于申请一个辅助空间,每次扩展容量一倍
    Object[] larger = new Object[size()*2];
    for(int index = 0;index 

  void addFirst(E e); // 将指定元素插入此列表的开头 

  E getFirst(); // 返回此列表的第一个元素 

  E removeFirst(); // 移除并返回此列表第一个元素 

  boolean isEmpty(); // 判断栈空 

 import java.util.LinkedList; 
  import java.util.NoSuchElementException; 
   
   
  public class SimulateStack { 
    private LinkedList stack = new LinkedList(); 
     
    public boolean isEmpty() { 
      return this.stack.isEmpty(); 
    } 
     
    public void push(int data) { 
      this.stack.addFirst(data); 
    } 
     
    public int pop() throws NoSuchElementException{ 
      return this.stack.removeFirst(); 
    } 
     
    public int getTop() throws NoSuchElementException{ 
      return this.stack.getFirst(); 
    } 
     
    public static void main(String args[]) { 
      SimulateStack s = new SimulateStack(); 
       
      s.push(1); 
      s.push(2); 
      s.push(3); 
       
      while (! s.isEmpty()) { 
        int data = s.getTop(); 
        System.out.println(data); 
        s.pop(); 
      } 
    } 
  }