队列入门

public class QueueTest {
    public static void main(String[] args) {
        Queue<Integer> queue = new LinkedList<>();
        queue.add(10);
        queue.add(12);
        // 获取第一个元素
        Integer peek = queue.peek();
        // 队列先入先出，删除先添加的元素
        Integer poll = queue.poll();
        // PriorityQueue可以设置队列的优先级
        PriorityQueue<Student> queue1 = new PriorityQueue<>(new Comparator<Student>() {

            @Override
            public int compare(Student t0, Student t1) {
                return t0.getId() - t1.getId();
            }
        });
        Student s1 = new Student(12, "小明");
        Student s2 = new Student(6, "小强");
        queue1.add(s1);
        queue1.add(s2);
        System.out.println(queue1);

    }
    static class Student{
        private String name;
        private int id;

        public String getName() {
            return name;
        }

        public void setName(String name) {
            this.name = name;
        }

        public int getId() {
            return id;
        }

        public void setId(int id) {
            this.id = id;
        }

        public Student(int id, String name) {
            this.name = name;
            this.id = id;
        }

        @Override
        public String toString() {
            return "Student{" +
                    "name='" + name + '\'' +
                    ", id=" + id +
                    '}';
        }
    }
}