package com.cl.content01;
/*
 * 使用鏈表來實現(xiàn)棧
 */
public class Stack<E> {
  Node<E> top=null;
  
  public boolean isEmpty(){
 return top==null;
  }
  /*
  * 出棧
  */
  public void push(E data){
 Node<E> nextNode=new Node<E>(data);
 nextNode.next=top;
 top=nextNode;
  }
  /*
  * 出棧
  */
  public E pop(){
 if(this.isEmpty()){
 return null;
 }
 E data =top.datas;
 top=top.next;
 return data;
  }
}
/*
 * 鏈表
 */
class Node<E>{
Node<E> next=null;
E datas;
public Node(E datas){
this.datas=datas;
}
}

package com.cl.content01;


public class MyQueue<E> {
  private Node<E> head=null;
  private Node<E> tail=null;
  public boolean isEmpty(){
  return head==null;
  }
  public void put(E data){
  Node<E> newNode=new Node<E>(data);
  if(head==null&&tail==null)
  head=tail=newNode;
  else
  tail.next=newNode;
    tail=newNode;
  }
  public E pop(){
  if(this.isEmpty())
  return null;
  E data=head.data;
  head=head.next;
  return data;
  }
  public int size(){
  int n=0;
  Node<E> t=head;
  while(t!=null){
  n++;
  t=t.next;
  }
  return n;
  }
  public static void main(String[] args) {
MyQueue<Integer> q=new MyQueue<Integer>();
q.put(1);q.put(3);q.put(2);
System.out.println(q.pop());
System.out.println(q.size());
System.out.println(q.pop());
}
}
class Node<E>{
Node<E> next=null;
E data;
public Node(E data){
this.data=data;
}
}