各种条件真复杂,不仅是边界条件,而且还要分很多种情况讨论 而且 检查数组越界真心是个伤不起的活。。。
/**
* 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 ArrayList<Interval> insert(ArrayList<Interval> intervals, Interval newInterval) {
// Start typing your Java solution below
// DO NOT write main() function
int i = 0;
for (; i < intervals.size(); ++i)
if (intervals.get(i).end >= newInterval.start)
break;
int start = i;
for (; i < intervals.size(); ++i)
if (intervals.get(i).end >= newInterval.end)
break;
int end = i;
if (intervals.size() == 0 || start >= intervals.size()){
intervals.add(newInterval);
return intervals;
}
if (end >= intervals.size())
end--;
if (start == end){
if (intervals.get(start).start > newInterval.end)
intervals.add(start, newInterval);
else{
intervals.get(start).start = Math.min(newInterval.start, intervals.get(start).start);
intervals.get(start).end = Math.max(newInterval.end, intervals.get(start).end);
}
} else{
int tempstart = intervals.get(start).start;
int tempend = intervals.get(end).end;
if (intervals.get(end).start > newInterval.end){
for (int j = 0; j < end - start-1; ++j)
intervals.remove(start);
intervals.get(start).start = Math.min(tempstart, newInterval.start);
intervals.get(start).end = newInterval.end;
} else {
for (int j = 0; j < end - start; ++j)
intervals.remove(start);
intervals.get(start).start = Math.min(tempstart, newInterval.start);
intervals.get(start).end = Math.max(tempend, newInterval.end);
}
}
return intervals;
}
}