FilesExpand file tree

 master

/

MergeIntervals.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

43 lines (40 loc) · 1.1 KB

 master

/

MergeIntervals.java

Copy path

Top

File metadata and controls

• Code
• Blame

43 lines (40 loc) · 1.1 KB

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

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

37

38

39

40

41

42

43

import java.util.ArrayList;

import java.util.Arrays;

import java.util.Comparator;

/**

* Given a collection of intervals, merge all overlapping intervals.

*

* For example,

* Given [1,3],[2,6],[8,10],[15,18],

* return [1,6],[8,10],[15,18].

*/

public class MergeIntervals {

public class IntervalCmp implements Comparator<Interval> {

@Override

public int compare(Interval i1, Interval i2) {

if (i1.start < i2.start) return -1;

if (i1.start == i2.start && i1.end <= i2.end) return -1;

return 1;

}

}

public ArrayList<Interval> merge(ArrayList<Interval> intervals) {

ArrayList<Interval> ret = new ArrayList<Interval>();

if (intervals.size() == 0) return ret;

Interval[] arr = new Interval[intervals.size()];

intervals.toArray(arr);

Arrays.sort(arr, new IntervalCmp());

int start = arr[0].start;

int end = arr[0].end;

for (int i = 0; i < arr.length; i++) {

if (arr[i].start <= end) {

end = Math.max(end, arr[i].end);

} else {

ret.add(new Interval(start, end));

start = arr[i].start;

end = arr[i].end;

}

}

ret.add(new Interval(start, end));

return ret;

}

}