优先队列

Java 优先队列的使用

原文链接：

https://blog.csdn.net/jasonkwan12/article/details/79924077?ops_request_misc=%257B%2522request%255Fid%2522%253A%2522161795560916780264072874%2522%252C%2522scm%2522%253A%252220140713.130102334…%2522%257D&request_id=161795560916780264072874&biz_id=0&utm_medium=distribute.pc_search_result.none-task-blog-2_allsobaiduend~default-5-79924077.first_rank_v2_pc_rank_v29&utm_term=java%E4%BC%98%E5%85%88%E9%98%9F%E5%88%97&spm=1018.2226.3001.4187

package com.ztq.PriorityQueue.SmallToBig;

/**
 * @author: ZTQ
 * @Title: Person
 * @ProjectName: 贪心算法
 * @Description:
 * @date: 2021/4/9 16:14
 */
public class Person implements Comparable<Person> {
    String name;
    int age;

    public Person(String name, int age) {
        this.name = name;
        this.age = age;
    }

    public String getName() {
        return name;
    }

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

    public int getAge() {
        return age;
    }

    public void setAge(int age) {
        this.age = age;
    }

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

    @Override
    public int compareTo(Person o) {
        return age - o.age;
    }
}

package com.ztq.PriorityQueue.SmallToBig;

import com.ztq.PriorityQueue.SmallToBig.Person;

import java.util.PriorityQueue;

/**
 * @author: ZTQ
 * @Title: SmallToBig
 * @ProjectName: 贪心算法
 * @Description:
 * @date: 2021/4/9 16:17
 */


public class SmallToBig {
    public static void main(String[] args) {
        PriorityQueue<Person> priorityQueue = new PriorityQueue<>();
        Person a = new Person("A", 10);
        Person b = new Person("B", 20);
        Person c = new Person("C", 15);
        Person d = new Person("D", 16);
        Person e = new Person("E", 12);
        Person f = new Person("F", 30);
        priorityQueue.offer(a);
        priorityQueue.offer(b);
        priorityQueue.offer(c);
        priorityQueue.offer(d);
        priorityQueue.offer(e);
        priorityQueue.offer(f);
        System.out.println(priorityQueue.size());

        for (Person i : priorityQueue) {
            System.out.println(i);
        }
        
        System.out.println("--------------------");

        while(!priorityQueue.isEmpty()){
            System.out.println(priorityQueue.peek());
            priorityQueue.poll();
        }
    }
}

package com.ztq.PriorityQueue.BigToSmall;

/**
 * @author: ZTQ
 * @Title: Person
 * @ProjectName: 贪心算法
 * @Description:
 * @date: 2021/4/9 16:14
 */
public class Person implements Comparable<Person> {
    String name;
    int age;

    public Person(String name, int age) {
        this.name = name;
        this.age = age;
    }

    public String getName() {
        return name;
    }

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

    public int getAge() {
        return age;
    }

    public void setAge(int age) {
        this.age = age;
    }

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

    @Override
    public int compareTo(Person o) {
        return o.age - age;
    }
}

package com.ztq.PriorityQueue.BigToSmall;

import com.ztq.PriorityQueue.BigToSmall.Person;

import java.util.PriorityQueue;

/**
 * @author: ZTQ
 * @Title: BigToSmall
 * @ProjectName: 贪心算法
 * @Description:
 * @date: 2021/4/9 17:04
 */
public class BigToSmall {
    public static void main(String[] args) {
        PriorityQueue<Person> priorityQueue = new PriorityQueue<>();
        Person a = new Person("A", 10);
        Person b = new Person("B", 20);
        Person c = new Person("C", 15);
        Person d = new Person("D", 16);
        Person e = new Person("E", 12);
        Person f = new Person("F", 30);
        priorityQueue.offer(a);
        priorityQueue.offer(b);
        priorityQueue.offer(c);
        priorityQueue.offer(d);
        priorityQueue.offer(e);
        priorityQueue.offer(f);

        System.out.println(priorityQueue.size());
        for(Person p : priorityQueue){
            System.out.println(p);
        }
        System.out.println("----------------");
        while(!priorityQueue.isEmpty()){
            System.out.println(priorityQueue.peek());
            priorityQueue.poll();
        }




    }
}