请使用LinkedList来模拟一个队列(先进先出的特性): [必做题] 1.1 拥有放入对象的方法void put(Object o) 1.2 取出对象的方法Object get() 1.3 判断队

package javademo12;

import java.util.LinkedList;

public class Queue {
	private LinkedList list = new LinkedList();
	
	public void put(Object obj) {
		list.addLast(obj);
	}
	
	public Object get() {
		return list.removeFirst();
	}
	
	public boolean isEmpty() {
		boolean b = true;
		
		if(list.size()>0) {
			b = false;
		}
		
		return b;
	}
	
	public void show() {
		System.out.println(list);
	}
}
package javademo12;

public class Test4 {

	public static void main(String[] args) {
		Queue queue = new Queue();
		
		boolean b = queue.isEmpty();
		System.out.println(b);
		
		queue.put("tom");
		queue.put("marry");
		
		b = queue.isEmpty();
		System.out.println(b);
		queue.show();
		
		queue.get();
		queue.show();
	}

}