Given a data stream input of non-negative integers a1, a2, ..., an, ..., summarize the numbers seen so far as a list of disjoint intervals.
For example, suppose the integers from the data stream are 1, 3, 7, 2, 6, ..., then the summary will be:
[1, 1] [1, 1], [3, 3] [1, 1], [3, 3], [7, 7] [1, 3], [7, 7] [1, 3], [6, 7]
Follow up:
What if there are lots of merges and the number of disjoint intervals are small compared to the data stream's size?
这个题思路很简单了,考虑清除各种情况就好了
/**
* 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 SummaryRanges {
List<Interval> intervals;
/** Initialize your data structure here. */
public SummaryRanges() {
intervals=new ArrayList<Interval>();
}
public void addNum(int val) {
if(intervals.size()==0){
intervals.add(new Interval(val, val));
}
int i=0;
for(;i<intervals.size();i++){
if(val>intervals.get(i).start){
if(val<=intervals.get(i).end){
return;
}else if(val==intervals.get(i).end+1){
intervals.get(i).end=val;
if(i+1<intervals.size()){
if(val+1==intervals.get(i+1).start){
intervals.get(i).end=intervals.get(i+1).end;
intervals.remove(i+1);
}
}
return;
}
}else if(val<intervals.get(i).start){
if(val==intervals.get(i).start-1){
intervals.get(i).start=val;
}else{
intervals.add(i, new Interval(val, val));
}
//只要是小于就要结束循环
return;
}else{
return;
}
}
if(i==intervals.size()){
intervals.add(new Interval(val,val));
}
}
public List<Interval> getIntervals() {
return intervals;
}
}
/**
* Your SummaryRanges object will be instantiated and called as such:
* SummaryRanges obj = new SummaryRanges();
* obj.addNum(val);
* List<Interval> param_2 = obj.getIntervals();
*/