Thanks to visit codestin.com
Credit goes to github.com

Skip to content

Commit 8b37fb1

Browse files
authored
Merge pull request #15 from ProgrammingPete/main
Added 435 Non-Overlapping Intervals Java Solution
2 parents bd6cf3c + 80221a4 commit 8b37fb1

File tree

1 file changed

+28
-0
lines changed

1 file changed

+28
-0
lines changed
Lines changed: 28 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,28 @@
1+
public class Solution {
2+
public int eraseOverlapIntervals(int[][] intervals) {
3+
int intervalsRemoved = 0;
4+
5+
Arrays.sort(intervals, (arr1,arr2) -> Integer.compare(arr1[0], arr2[0]));
6+
7+
int[] intervalFirst = intervals[0];
8+
9+
for(int i = 1; i < intervals.length; i++){
10+
if(firstIntervalwithinSecond(intervalFirst, intervals[i])){
11+
//mark first interval to be removed
12+
intervalsRemoved++;
13+
// determine which interval to remove
14+
//remove the interval that ends last
15+
if(intervalFirst[1] > intervals[i][1]){
16+
intervalFirst = intervals[i];
17+
}
18+
} else {
19+
intervalFirst = intervals[i];
20+
}
21+
}
22+
return intervalsRemoved;
23+
}
24+
25+
public boolean firstIntervalwithinSecond(int[] intervalFirst, int[] intervalSecond){
26+
return intervalSecond[0] < intervalFirst[1];
27+
}
28+
}

0 commit comments

Comments
 (0)