Merge Intervals LeetCode solution in C++

1
class Solution {
2
 public:
3
  vector<vector<int>> merge(vector<vector<int>> &intervals) {
4
    sort(intervals.begin(), intervals.end());
5
    vector<vector<int>> res;
6
    int i = 0;
7
    while (i <= intervals.size() - 1) {
8
      int start = intervals[i][0];
9
      int end = intervals[i][1];
10
      while (i < intervals.size() - 1 && end >= intervals[i + 1][0]) {
11
        i++;
12
        if (end < intervals[i][1]) end = intervals[i][1];
13
      }
14
      i++;
15
      res.push_back({start, end});
16
    }
17
    return res;
18
  }
19
};