Today I have done leetcode's March LeetCoding Challenge with cpp.

March LeetCoding Challenge 17

Description

Insert Interval

You are given an array of non-overlapping intervals intervals where intervals[i] = [starti, endi] represent the start and the end of the ith interval and intervals is sorted in ascending order by starti. You are also given an interval newInterval = [start, end] that represents the start and end of another interval.

Insert newInterval into intervals such that intervals is still sorted in ascending order by starti and intervals still does not have any overlapping intervals (merge overlapping intervals if necessary).

Return intervals after the insertion.

Note that you don't need to modify intervals in-place. You can make a new array and return it.

Example 1:

Input: intervals = [[1,3],[6,9]], newInterval = [2,5]
Output: [[1,5],[6,9]]

Example 2:

Input: intervals = [[1,2],[3,5],[6,7],[8,10],[12,16]], newInterval = [4,8]
Output: [[1,2],[3,10],[12,16]]
Explanation: Because the new interval [4,8] overlaps with [3,5],[6,7],[8,10].

Constraints:

• 0 <= intervals.length <= 104
• intervals[i].length == 2
• 0 <= starti <= endi <= 105
• intervals is sorted by starti in ascending order.
• newInterval.length == 2
• 0 <= start <= end <= 105

Solution

auto speedup = [](){
  cin.tie(nullptr);
  cout.tie(nullptr);
  ios::sync_with_stdio(false);
  return 0;
}();
class Solution {
public:
  vector<vector<int>> insert(vector<vector<int>>& intervals, vector<int>& newInterval) {
    intervals.insert(lower_bound(intervals.begin(), intervals.end(), newInterval), newInterval);
    intervals.push_back({100002, -1});
    int len = intervals.size();
    int pos = 0;
    int begin = intervals.front()[0];
    int end = intervals.front()[1];
    for(int i = 0; i < len; ++i) {
      if(intervals[i][0] <= end) {
        end = max(end, intervals[i][1]);
      } else {
        intervals[pos][0] = begin;
        intervals[pos][1] = end;
        pos += 1;
        begin = intervals[i][0];
        end = intervals[i][1];
      }
    }
    intervals.resize(pos);
    return intervals;
  }
};

// Accepted
// 156/156 cases passed (16 ms)
// Your runtime beats 83.48 % of cpp submissions
// Your memory usage beats 92.65 % of cpp submissions (17 MB)