Untitled

class Solution {
    public int[][] merge(int[][] intervals) {
        int i, j=0, n = intervals.length, flag = 0;
        int[][] newIntervals = new int[n][2];
        for(i=0;i<n;++i)
        {
            if(i+1!=n)
            {
                if(flag!=1 && intervals[i][1]>intervals[i+1][0])
                {
                    newIntervals[j][0] = intervals[i][0];
                    newIntervals[j][1] = intervals[i+1][1];
                    flag = 1;
                    j++;
                }
                else if(flag==1 && intervals[j-1][1]>intervals[i+1][0])
                {
                    newIntervals[j][1] = intervals[i+1][1];
                    flag = 1;
                    j++;
                }
                else
                {
                    newIntervals[j][0] = intervals[i][0];
                    newIntervals[j][1] = intervals[i][1];
                    flag = 0;
                }
            }
            
        }
        
        return newIntervals;
    }
}