代码随性录算法训练营day36 453.无重叠区间 763.划分字母区间 56.合并区间

最新推荐文章于 2024-06-15 23:36:03 发布

二木三金l

最新推荐文章于 2024-06-15 23:36:03 发布

阅读量28

点赞数

文章标签：算法

本文链接：https://blog.csdn.net/m0_74100262/article/details/131714396

版权

题目链接453.无重叠区间

class Solution {
    public int eraseOverlapIntervals(int[][] intervals) {
        Arrays.sort(intervals,(a,b)->{
            return Integer.compare(a[0],b[0]);
        });
        int count = 1;
        for(int i = 1; i < intervals.length;i++){
            if(intervals[i][0] < intervals[i-1][1]){
                intervals[i][1] = Math.min(intervals[i][1], intervals[i-1][1]);
                continue;
            }else{
                count++;
            }
        }
        return intervals.length - count;
    }
}

题目链接763.划分字母区间

class Solution {
    public List<Integer> partitionLabels(String s) {
        List<Integer> list = new LinkedList<>();
        int[] edge = new int[26];
        char[] chars = s.toCharArray();
        for(int i = 0; i < chars.length; i++){
            edge[chars[i] - 'a'] = i;
        }
        int idx = 0;
        int last = -1;
        for(int i = 0; i < chars.length; i++){
            idx = Math.max(idx, edge[chars[i] - 'a']);
            if(idx == i){
                list.add(i - last);
                last = i;
            }
        }
        return list;
    }
}

题目链接56.合并区间

class Solution {
    public int[][] merge(int[][] intervals) {
        List<int[]> res = new LinkedList<>();
        Arrays.sort(intervals, (a,b) -> Integer.compare(a[0],b[0]));
        int start = intervals[0][0];
        int rightmostRightBound = intervals[0][1];
        for(int i = 1; i < intervals.length; i++){
            if(intervals[i][0] > rightmostRightBound){
                res.add(new int[]{start,rightmostRightBound});
                start = intervals[i][0];
                rightmostRightBound = intervals[i][1];  
            }else{
                rightmostRightBound = Math.max(rightmostRightBound, intervals[i][1]);
            }
        }
        res.add(new int[]{start,rightmostRightBound});
        return res.toArray(new int[res.size()][]);
    }
}