leetcode 435. Non-overlapping Intervals

最新推荐文章于 2025-01-23 19:15:00 发布

原创最新推荐文章于 2025-01-23 19:15:00 发布 · 258 阅读

0 ·

CC 4.0 BY-SA版权

leetcode 专栏收录该内容

9 篇文章

订阅专栏

本文介绍了一个Java程序，该程序能够解决区间调度问题，通过消除给定区间集合中的重叠区间来最小化所需的区间数量。使用自定义比较器按区间结束时间进行排序，并采用贪心算法策略实现。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

借鉴了别人的代码，写成java

package leetcode;

import java.util.Arrays;
import java.util.Comparator;

class Interval {
    int start;
    int end;
    Interval() { start = 0; end = 0; }
    Interval(int s, int e) { start = s; end = e; }
}

class myComparator implements Comparator<Interval> {
    public int compare(Interval a, Interval b) {
        return a.end - b.end;
    }
}


public class NonoverlappingIntervals {

    public static int eraseOverlapIntervals(Interval[] intervals) {
        if (intervals.length == 0)  return 0;
        Arrays.sort(intervals, new myComparator());
        float end = (float) (-1/0.0);
        int erased = 0;    
        for (Interval i:intervals){
            if (i.start >= end)
                end = i.end;
            else
                erased += 1;               
        }         
        return erased;
    }

    public static void main(String[] args) {

        Interval[] intervals = new Interval[3];
        Interval x = new Interval(1,3);
        Interval y = new Interval(3,5);
        Interval z = new Interval(5,6);
        Arrays.fill(intervals,0,1,x);
        Arrays.fill(intervals,1,2,y);
        Arrays.fill(intervals,2,3,z);
        System.out.println(eraseOverlapIntervals(intervals));
    }
}