Update 0057-insert-interval.cpp

I think my code resembles the video solution you have provided. Please have a look. Also it is analogous to the python solution.

Author: Akshat202002

cpp/0057-insert-interval.cpp

@@ -11,28 +11,29 @@
 class Solution {
 public:
     vector<vector<int>> insert(vector<vector<int>>& intervals, vector<int>& newInterval) {
-        int i = 0;
+        vector<vector<int>> ans;
+        int newStart = newInterval[0];
+        int newEnd = newInterval[1];
         int n = intervals.size();
-        
-        vector<vector<int>> result;
-        
-        while (i < n && intervals[i][1] < newInterval[0]) {
-            result.push_back(intervals[i]);
-            i++;
+        for (int i = 0; i < n; i++) {
+            // Case 1: Non overlapping interval
+            // If new interval is before the current interval
+            if (intervals[i][0] > newEnd) {
+                ans.push_back(newInterval);
+                copy(intervals.begin() + i, intervals.end(), back_inserter(ans));
+                return ans;
+            }
+            // If new interval is after the current interval
+            else if (intervals[i][1] < newStart) {
+                ans.push_back(intervals[i]);
+            }
+            // Case 2: Overlapping interval
+            else {
+                newInterval[0] = min(newInterval[0], intervals[i][0]);
+                newInterval[1] = max(newInterval[1], intervals[i][1]);
+            }
         }
-        
-        while (i < n && intervals[i][0] <= newInterval[1]) {
-            newInterval[0] = min(newInterval[0], intervals[i][0]);
-            newInterval[1] = max(newInterval[1], intervals[i][1]);
-            i++;
-        }
-        result.push_back(newInterval);
-        
-        while (i < n) {
-            result.push_back(intervals[i]);
-            i++;
-        }
-        
-        return result;
+        ans.push_back(newInterval);
+        return ans;
     }
 };