Java实现常见的数据结构

1、普通队列

import java.util.LinkedList;


public class MyQueue<E> {
    
    private LinkedList<E> list = new LinkedList<E>();

    public void enqueue(E e) {
        list.addLast(e);
    }

    public E dequeue() {
        return list.removeFirst();
    }

    public int getSize() {
        return list.size();
    }

    public String toString() {
        return "Queue" + list.toString();
    }
    
    public static void main(String[] args) {
        MyQueue<String> myqueue = new MyQueue();
        myqueue.enqueue("x1");
        myqueue.enqueue("x2");
        int size = myqueue.getSize();
        System.out.println(size);
        System.out.println(myqueue.dequeue());
        
        
    }
}

2、优先队列

public class MyPriorityQueue<E extends Comparable> {
    private Heap<E> heap = new Heap<E>();

    public void enqueue(E newObject) {
        heap.add(newObject);
    }

    public dequeue() {
        return heap.remove();
    }

    public int getSize() {
        return heap.getSize();
    }
}