leetcode630

题目链接leetcode630

public class scheduleCourse630 {

    /**
     * 贪心，有限选择课程结束时间早的，考虑 [[5,5],[4,6],[2,6]]，如果执行先学习[5,5]，发现后面的都不能学习，但是发现5 > 2，那么可以将5抛出，替换为2，是为了缩小时间差
     * @param courses
     * @return
     */
    public int scheduleCourse(int[][] courses) {
        Arrays.sort(courses, Comparator.comparingInt(a -> a[1]));
        int cur = 0;
        PriorityQueue<Integer> queue = new PriorityQueue<>((a, b) -> b - a);
        for (int[] c : courses) {
            int t1 = c[0];
            int t2 = c[1];
            if (cur + t1 <= t2) {
                queue.offer(t1);
                cur += t1;
            } else if (!queue.isEmpty() && queue.peek() > t1) {
                cur += (t1 - queue.poll());
                queue.offer(t1);
            }
        }
        return queue.size();
    }
}