<p>You are given an array of non-overlapping intervals <code>intervals</code> where <code>intervals[i] = [start<sub>i</sub>, end<sub>i</sub>]</code> represent the start and the end of the <code>i<sup>th</sup></code> interval and <code>intervals</code> is sorted in ascending order by <code>start<sub>i</sub></code>. You are also given an interval <code>newInterval = [start, end]</code> that represents the start and end of another interval.</p>

<p>Insert <code>newInterval</code> into <code>intervals</code> such that <code>intervals</code> is still sorted in ascending order by <code>start<sub>i</sub></code> and <code>intervals</code> still does not have any overlapping intervals (merge overlapping intervals if necessary).</p>

<p>Return <code>intervals</code><em> after the insertion</em>.</p>

<p><strong>Note</strong> that you don&#39;t need to modify <code>intervals</code> in-place. You can make a new array and return it.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> intervals = [[1,3],[6,9]], newInterval = [2,5]
<strong>Output:</strong> [[1,5],[6,9]]
</pre>

<p><strong class="example">Example 2:</strong></p>

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

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>0 &lt;= intervals.length &lt;= 10<sup>4</sup></code></li>
	<li><code>intervals[i].length == 2</code></li>
	<li><code>0 &lt;= start<sub>i</sub> &lt;= end<sub>i</sub> &lt;= 10<sup>5</sup></code></li>
	<li><code>intervals</code> is sorted by <code>start<sub>i</sub></code> in <strong>ascending</strong> order.</li>
	<li><code>newInterval.length == 2</code></li>
	<li><code>0 &lt;= start &lt;= end &lt;= 10<sup>5</sup></code></li>
</ul>

class Solution {
public:
    vector<vector<int>> insert(vector<vector<int>>& intervals, vector<int>& newInterval) {
        int n= intervals.size();
        int start=newInterval[0];
        int end= newInterval[1];
        int start_interval=-1;
        int end_interval=-1;
        vector<vector<int>> ans;
        if(n==0){
            ans.push_back(newInterval);
            return ans;
        }
        for(int i=0; i<=n-1; i++){
            if(intervals[i][0]<=start && intervals[i][1]>=start){
                start_interval=i;
                break;
            }
        }
        for(int i=0; i<=n-1; i++){
            if(intervals[i][1]>=end && intervals[i][0]<=end){
                end_interval=i;
                break;
            }
        }
        int flag=0;
        if(start_interval!=-1 && end_interval!=-1){
            for(int i=0; i<=n-1; i++){
                if(flag==0 && i==start_interval){
                    vector<int> k={intervals[start_interval][0],intervals[end_interval][1]};
                    ans.push_back(k);
                    i=end_interval;
                    flag=1;
                }
                else{
                    ans.push_back(intervals[i]);
                }
            }
        }
        else if(start_interval==-1 && end_interval!=-1){
            for(int i=0; i<=n-1; i++){
                if(flag==0 && intervals[i][0]>start){
                    vector<int> k={start,intervals[end_interval][1]};
                    ans.push_back(k);
                    i=end_interval;
                    flag=1;
                }
                else{
                    ans.push_back(intervals[i]);
                }
            }
        }
        else if(start_interval!=-1 && end_interval==-1){
            for(int i=n-1; i>=0; i--){
                cout<<i;
                if(flag==0 && intervals[i][1]<end){
                    cout<<i;
                    vector<int> k={intervals[start_interval][0],end};
                    ans.insert(ans.begin(),k);
                    i=start_interval;
                    flag=1;
                }
                else{
                    cout<<i;
                    ans.insert(ans.begin(),intervals[i]);
                }
            }
        }
        else{
            for(int i=0; i<=n-1; i++){
                if(flag==0 && intervals[i][0]>start && intervals[i][0]>end){
                    vector<int> k={start,end};
                    ans.push_back(k);
                    i=i-1;
                    flag=1;
                }
                else if(flag==0 && intervals[i][0]>start && intervals[i][0]<end){
                    for(int j=i+1; j<=n-1; j++){
                        if(intervals[j][0]>end){
                            vector<int> k={start,end};
                            ans.push_back(k);
                            i=j-1;
                            flag=1;
                        }
                    }
                }
                else{
                    ans.push_back(intervals[i]);
                }
            }
            if(flag==0){
                vector<int> k={start,end};
                ans.push_back(k);
            }
        }
        return ans;
    }
};
21200