[LeetCode] 435. Non-overlapping Intervals

Given a collection of intervals, find the minimum number of intervals you need to remove to make the rest of the intervals non-overlapping.
Note:
  1. You may assume the interval's end point is always bigger than its start point.
  2. Intervals like [1,2] and [2,3] have borders "touching" but they don't overlap each other.
Example 1:
Input: [ [1,2], [2,3], [3,4], [1,3] ]

Output: 1

Explanation: [1,3] can be removed and the rest of intervals are non-overlapping.
Example 2:
Input: [ [1,2], [1,2], [1,2] ]

Output: 2

Explanation: You need to remove two [1,2] to make the rest of intervals non-overlapping.
Example 3:
Input: [ [1,2], [2,3] ]

Output: 0

Explanation: You don't need to remove any of the intervals since they're already non-overlapping.

Thought process:

The idea is to sort the array based on the intervals start points and use a greedy approach.

After the array is sorted, iterate through the array and use a local variable "end" to keep track of the smallest end point of current overlapping intervals. The reason is that we want to delete all overlapping intervals except the one that has the smallest end point, so that the next interval won't overlap with it.

Once we iterate through a group of overlapping intervals, we update "end" to be the end point of the next interval.

Solution:


 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
/**
 * Definition for an interval.
 * public class Interval {
 *     int start;
 *     int end;
 *     Interval() { start = 0; end = 0; }
 *     Interval(int s, int e) { start = s; end = e; }
 * }
 */
public class Solution {
    public int eraseOverlapIntervals(Interval[] intervals) {
        if (intervals.length < 2) {
            return 0;
        }
        
        Arrays.sort(intervals, new Comparator<Interval>(){
            public int compare(Interval i1, Interval i2) {
                return i1.start - i2.start;
            }
        });
        
        int end = intervals[0].end;
        int min = 0;
        
        for (int i = 1; i < intervals.length; i++) {
            if (intervals[i].start < end) {
                end = Math.min(end, intervals[i].end);
                min++;
            } else {
                end = intervals[i].end;
            }
        }
        
        return min;
    }
}

Time complexity:

Sorting takes O(nlogn). For loop takes O(n). The overall time complexity is O(nlogn).
Location: Philadelphia, PA, USA

Comments

  1. dhanviJune 17, 2020 at 3:38 AM

    we need to sort according to end time and not start time to allow maximum non-overlapping intervals to be taken

    ReplyDelete
  2. Eman QurashiDecember 24, 2021 at 11:23 PM

    I found that solution is very popular and helpful: https://youtu.be/2NN6N-tNyag

    ReplyDelete

Post a Comment

Popular posts from this blog

[LeetCode] 269. Alien Dictionary

There is a new alien language which uses the latin alphabet. However, the order among letters are unknown to you. You receive a list of  non-empty  words from the dictionary, where  words are sorted lexicographically by the rules of this new language . Derive the order of letters in this language. Example 1: Given the following words in dictionary, [ "wrt", "wrf", "er", "ett", "rftt" ] The correct order is:  "wertf" . Example 2: Given the following words in dictionary, [ "z", "x" ] The correct order is:  "zx" . Example 3: Given the following words in dictionary, [ "z", "x", "z" ] The order is invalid, so return  "" . Note: You may assume all letters are in lowercase. You may assume that if a is a prefix of b, then a must appear before b in the given dictionary. If the order is invalid, return an empty string
Read more

[HackerRank] Roads and Libraries

Image
The Ruler of HackerLand believes that every citizen of the country should have access to a library. Unfortunately, HackerLand was hit by a tornado that destroyed all of its libraries and obstructed its roads! As you are the greatest programmer of HackerLand, the ruler wants your help to repair the roads and build some new libraries efficiently. HackerLand has   cities numbered from   to  . The cities are connected by   bidirectional roads. A citizen has access to a library if: Their city contains a library. They can travel by road from their city to a city containing a library. The following figure is a sample map of HackerLand where the dotted lines denote obstructed roads: The cost of repairing any road is   dollars, and the cost to build a library in any city is   dollars. You are given   queries, where each query consists of a map of HackerLand and value of   and  . For each query, find the minimum cost of making libraries accessible to all the citizens and prin
Read more

[LeetCode] 631. Design Excel Sum Formula

Your task is to design the basic function of Excel and implement the function of sum formula. Specifically, you need to implement the following functions: Excel(int H, char W):  This is the constructor. The inputs represents the height and width of the Excel form.  H  is a positive integer, range from 1 to 26. It represents the height.  W  is a character range from 'A' to 'Z'. It represents that the width is the number of characters from 'A' to  W . The Excel form content is represented by a height * width 2D integer array  C , it should be initialized to zero. You should assume that the first row of  C  starts from 1, and the first column of  C  starts from 'A'. void Set(int row, char column, int val):  Change the value at  C(row, column)  to be val. int Get(int row, char column):  Return the value at  C(row, column) . int Sum(int row, char column, List of Strings : numbers):  This function calculate and set the value at  C(row, column) , wh
Read more