Day 36 | 435. Non-overlapping Intervals | 763. Partition Labels | 56. Merge Intervals

王锴KKKKKKyle

已于 2023-01-19 10:36:35 修改

阅读量118

点赞数

分类专栏： LeetCode 文章标签： leetcode

于 2023-01-18 15:09:04 首次发布

本文链接：https://blog.csdn.net/kyle313606922/article/details/128722599

版权

LeetCode 专栏收录该内容

52 篇文章 0 订阅

订阅专栏

文章列举了一系列LeetCode上的编程挑战，涉及排序、搜索、数组操作、链表操作、二叉树构建和遍历等算法问题，包括非重叠区间、分割标签、合并区间等主题。每个问题都简要介绍了解题策略，如排序、更新区间边界等。

摘要由CSDN通过智能技术生成

LeetCode 435. Non-overlapping Intervals

Question Link

class Solution {
    public int eraseOverlapIntervals(int[][] intervals) {
        Arrays.sort(intervals, (a, b) -> {
            return Integer.compare(a[0], b[0]);
        });
        int count = 1;  // The number of non-overlapping intervals
        for(int i = 1; i < intervals.length; i++){
            if(intervals[i][0] < intervals[i-1][1])
                intervals[i][1] = Math.min(intervals[i-1][1], intervals[i][1]); // Update the right border of interval i
            else
                count++; 
        }
        return intervals.length - count;     // The number of intervals need to be removed
    }
}

This question is similar to 452. Minimum Number of Arrows to Burst Balloons.
The number of arrows equals the number of non-overlapping intervals.
Use the total number of intervals minus the number of arrows. We can get how many intervals we should remove.

LeetCode 763. Partition Labels

Question Link

class Solution {
    public List<Integer> partitionLabels(String s) {
        List<Integer> list = new LinkedList<>();
        int[] edge = new int[26];
        char[] chars = s.toCharArray();
        // Count the last present position of every character
        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++){
            // Update the index of the furthest occurrence of the character
            idx = Math.max(idx, edge[chars[i] - 'a']);
            // If we find a character whose index is equal to the index of the furthest occurrence character, it is the split point.
            if(i == idx){
                list.add(i - last);
                last = i;
            }
        }
        return list;
    }
}

Count the last present position of every character
Traverse the characters, and update the index of the furthest occurrence of the character. If we find a character whose index is equal to the index of the furthest occurrence character, it is the split point.

LeetCode 56. Merge Intervals

Question Link

class Solution {
    public int[][] merge(int[][] intervals) {
        // Sort by the left border ASC
        Arrays.sort(intervals, (o1, o2) -> Integer.compare(o1[0], o2[0]));

        LinkedList<int[]> res = new LinkedList<>();
        res.add(intervals[0]);
        for (int i = 1; i < intervals.length; i++) {
            // Merge
            if (intervals[i][0] <= res.getLast()[1]) {
                int start = res.getLast()[0];
                int end = Math.max(intervals[i][1], res.getLast()[1]);
                res.removeLast();
                res.add(new int[]{start, end});
            }
            else {
                res.add(intervals[i]);
            }         
        }
        return res.toArray(new int[res.size()][]);
    }
}