LeetCode: Insert Interval

C++

/**
 * Definition for an interval.
 * struct Interval {
 *     int start;
 *     int end;
 *     Interval() : start(0), end(0) {}
 *     Interval(int s, int e) : start(s), end(e) {}
 * };
 */
class Solution {
public:
    vector<Interval> insert(vector<Interval> &intervals, Interval newInterval) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        vector<Interval> ret;
        ret.push_back(newInterval);
        for (int i = 0; i < intervals.size(); i++) {
            if (intervals[i].end < ret.back().start) ret.insert(ret.end()-1, intervals[i]);
            else if (intervals[i].start > ret.back().end) ret.push_back(intervals[i]);
            else {
                ret.back().start = min(ret.back().start, intervals[i].start);
                ret.back().end = max(ret.back().end, intervals[i].end);
            }
        }
        return ret;
    }
};

 C#

/**
 * Definition for an interval.
 * public class Interval {
 *     public int start;
 *     public int end;
 *     public Interval() { start = 0; end = 0; }
 *     public Interval(int s, int e) { start = s; end = e; }
 * }
 */
public class Solution {
    public List<Interval> Insert(IList<Interval> intervals, Interval newInterval) {
        List<Interval> ans = new List<Interval>();
        ans.Add(newInterval);
        for (int i = 0; i < intervals.Count; i++) {
            if (intervals[i].end < ans[ans.Count-1].start) ans.Insert((int)ans.Count-1, intervals[i]);
            else if (intervals[i].start > ans[ans.Count-1].end) ans.Add(intervals[i]);
            else {
                ans[ans.Count-1].start = Math.Min(ans[ans.Count-1].start, intervals[i].start);
                ans[ans.Count-1].end = Math.Max(ans[ans.Count-1].end, intervals[i].end);
            }
        }
        return ans;
    }
}