-
Notifications
You must be signed in to change notification settings - Fork 5
/
Copy pathDataStreamAsDisjointIntervals.java
68 lines (64 loc) · 2.09 KB
/
DataStreamAsDisjointIntervals.java
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
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
/*https://leetcode.com/problems/data-stream-as-disjoint-intervals/*/
class SummaryRanges {
List<List<Integer>> intervals;
HashSet<Integer> set;
public SummaryRanges() {
intervals = new ArrayList<List<Integer>>();
set = new HashSet<Integer>();
}
public void addNum(int val) {
if (set.contains(val)) return;
set.add(val);
List<Integer> interval;
int i = -1;
for (i = 0; i < intervals.size(); ++i)
{
interval = intervals.get(i);
if (val == interval.get(0)-1 || val == interval.get(1)+1)
break;
}
if (intervals.size() == 0)
intervals.add(Arrays.asList(val,val));
else if (i == intervals.size())
intervals.add(Arrays.asList(val,val));
else
{
interval = intervals.get(i);
if (val == interval.get(0)-1)
{
interval.set(0,val);
if (i != 0 && intervals.get(i-1).get(1) == val-1)
{
interval.set(0,intervals.get(i-1).get(0));
intervals.remove(i-1);
}
}
else if (val == interval.get(1)+1)
{
interval.set(1,val);
if (i != intervals.size()-1 && intervals.get(i+1).get(0) == val+1)
{
interval.set(1,intervals.get(i+1).get(1));
intervals.remove(i+1);
}
}
else intervals.add(Arrays.asList(val,val));
}
Collections.sort(intervals,(a,b)->(a.get(0)-b.get(0)));
}
public int[][] getIntervals() {
int[][] result = new int[intervals.size()][2];
for (int i = 0; i < result.length; ++i)
{
result[i][0] = intervals.get(i).get(0);
result[i][1] = intervals.get(i).get(1);
}
return result;
}
}
/**
* Your SummaryRanges object will be instantiated and called as such:
* SummaryRanges obj = new SummaryRanges();
* obj.addNum(val);
* int[][] param_2 = obj.getIntervals();
*/