Leetcode-Insert Interval

 1 /**
 2  * Definition for an interval.
 3  * public class Interval {
 4  *     int start;
 5  *     int end;
 6  *     Interval() { start = 0; end = 0; }
 7  *     Interval(int s, int e) { start = s; end = e; }
 8  * }
 9  */
10 public class Solution {
11     public List<Interval> insert(List<Interval> intervals, Interval newInterval) {
12         List<Interval> newList = new ArrayList<Interval>();
13         
14         if (intervals.size()==0&&newInterval==null) return newList;
15         
16         if (intervals.size()==0){
17             newList.add(newInterval);
18             return newList;
19         }
20         
21         if (newInterval==null)
22             return intervals;
23             
24         int index = 0;
25         int st = newInterval.start;
26         int et = newInterval.end;
27         for (int i=0;i<intervals.size();i++){
28             Interval temp = intervals.get(i);
29             if (temp.end<st){
30                 newList.add(temp);
31                 index++;
32                 continue;
33             } else 
34                 break;
35         }
36         
37         //At the end of the intervals.
38         if (index==intervals.size()){
39             intervals.add(newInterval);
40             return intervals;
41         }
42         
43         Interval res = new Interval();
44         res.end = -1;
45         Interval temp = intervals.get(index);
46         if (temp.start>st)
47             res.start = st;
48         else
49             res.start = temp.start;
50             
51         //This is important.
52         if (temp.end<et)
53             index++;
54         
55         while (index<intervals.size()){
56             temp = intervals.get(index);
57             if (temp.end<et){
58                 //newList.add(temp);
59                 index++;
60                 continue;
61             } 
62             
63             if (temp.end==et){
64                 res.end = et;
65                 index++;
66                 break;
67             }
68             
69             if (temp.start<=et){
70                 res.end = temp.end;
71                 index++;
72                 break;
73             }
74             
75             if (temp.start>et){
76                 res.end = et;
77                 break;
78             }  
79         }
80         
81         if (res.end==-1){
82             res.end = et;
83             newList.add(res);
84             return newList;
85         }
86         
87         newList.add(res);
88         
89         while (index<intervals.size()){
90             temp = intervals.get(index);
91             newList.add(temp);
92             index++;
93         }
94         
95         
96         return newList;
97     }
98 }