leetcode-57-插入区间

1.问题描述

https://leetcode.cn/problems/insert-interval/

2. 解题代码

public class Solution {
    public int[][] Insert(int[][] intervals, int[] newInterval) {
        List<int[]> result = new List<int[]>();
        int[] current = new int[2] { newInterval[0], newInterval[1]};

        bool bAdd = true;
        if (intervals.Length >0&& intervals[0][0]> current[1])
        {
            bAdd = false;
            result.Add(current);
        }

        foreach (var item in intervals)
        {
            if (item[1] < current[0])
            {
                result.Add(item);
            }
            else if (item[0] > current[1])
            {
                if (bAdd)
                {
                    bAdd = false;
                    result.Add(current);
                }
                result.Add(item);
            }
            else
            {
                current[0] = current[0] < item[0] ? current[0] : item[0];
                current[1] = current[1] > item[1] ? current[1] : item[1];
            }
        }

        if (bAdd)
        {
            result.Add(current);
        }
        return result.ToArray();
    }
}