用LinkedList实现队列和栈

[b]队列实现：[/b]

package com.test.unicode;

import java.util.LinkedList;

public class MyQueue {
    private LinkedList<Object> queue = new LinkedList<Object>();

    public void put(Object o) {
        queue.addLast(o);
    }

    public Object get() {
        return queue.removeFirst();
    }

    public boolean empty() {
        return queue.isEmpty();
    }

    /**
     * @param args
     */
    public static void main(String[] args) {
        // TODO Auto-generated method stub
        MyQueue mq = new MyQueue();
        mq.put("zhangsan");
        mq.put("lisi");
        mq.put("wangwu");

        System.out.println(mq.get());
        System.out.println(mq.get());
        System.out.println(mq.get());
        System.out.println(mq.empty());

    }

}

[b]栈的实现：[/b]

package com.test.unicode;
import java.util.LinkedList;
public class MyStack {
    private LinkedList<Object> stack = new LinkedList<Object>();

    public Object pop() {
        if (stack.isEmpty()) {
            return null;
        }
        return stack.removeFirst();
    }

    public void push(Object o) {
        stack.addFirst(o);
    }

    public Object peek() {
        return stack.getFirst();
    }

    public boolean empty() {
        return stack.isEmpty();
    }

    /**
     * @param args
     */
    public static void main(String[] args) {
        // TODO Auto-generated method stub
        MyStack ms = new MyStack();
        ms.push("zhangsan");
        ms.push("lisi");
        ms.push("wangwu");

        System.out.println(ms.pop());
        System.out.println(ms.peek());
        System.out.println(ms.pop());
        System.out.println(ms.empty());

    }

}