Leetcode–refresh–insert Inverval

Similar to merge intervals. Easier than merge interval, because every side is kind of "sorted".

1 /**2 * Definition for an interval.3 * struct 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  */Ten classSolution { One  Public: Avector<interval> Insert (vector<interval> &intervals, Interval newinterval) { -Vector<interval>result; -         if(intervals.size () = =0) { the Result.push_back (newinterval); -             returnresult; -         } -queue<int>Left , right; +         intLen =intervals.size (); -         BOOLLF =true, RF =true; +          for(inti =0; i < Len; i++) { A             if(LF && Newinterval.start <Intervals[i].start) { at Left.push (newinterval.start); -LF =false; -             } -             if(RF && Newinterval.end <intervals[i].end) { - Right.push (newinterval.end); -RF =false; in             } - Left.push (intervals[i].start); to Right.push (intervals[i].end); +         } -         if(LF) Left.push (newinterval.start); the         if(RF) Right.push (newinterval.end); *          while(!Left.empty ()) { $             ints = Left.front (), E =Right.front ();Panax Notoginseng Left.pop (), Right.pop (); -              while(!Left.empty ()) { the                 if(e >=Left.front ()) { +E =Right.front (); A Left.pop (), Right.pop (); the}Else  Break; +             } - Result.push_back (Interval (S, e)); $         } $         returnresult; -     } -};

Leetcode–refresh–insert Inverval