如何在Java中实现任务优先级排序

public class Task implements Comparable<Task> {
    private String name;
    private int priority; // 数值越小，优先级越高

    public Task(String name, int priority) {
        this.name = name;
        this.priority = priority;
    }

    public String getName() {
        return name;
    }

    public int getPriority() {
        return priority;
    }

    @Override
    public int compareTo(Task other) {
        return Integer.compare(this.priority, other.priority);
    }

    @Override
    public String toString() {
        return "Task{name='" + name + "', priority=" + priority + '}';
    }
}

import java.util.PriorityQueue;

public class PriorityTaskScheduler {
    public static void main(String[] args) {
        PriorityQueue<Task> taskQueue = new PriorityQueue<>();

        // 添加任务（优先级数字越小越优先）
        taskQueue.offer(new Task("发送邮件", 3));
        taskQueue.offer(new Task("保存日志", 2));
        taskQueue.offer(new Task("系统初始化", 1));
        taskQueue.offer(new Task("用户通知", 4));

        // 按优先级执行任务
        while (!taskQueue.isEmpty()) {
            Task task = taskQueue.poll();
            System.out.println("执行: " + task);
        }
    }
}

执行: Task{name='系统初始化', priority=1}
执行: Task{name='保存日志', priority=2}
执行: Task{name='发送邮件', priority=3}
执行: Task{name='用户通知', priority=4}

PriorityQueue<Task> taskQueue = new PriorityQueue<>((t1, t2) -> 
    Integer.compare(t1.getPriority(), t2.getPriority())
);

// 高数值优先
PriorityQueue<Task> highPriorityFirst = new PriorityQueue<>((t1, t2) -> 
    Integer.compare(t2.getPriority(), t1.getPriority())
);