LeetCode 57. 插入区间 C#
原题链接
中等
作者:
hpstory
,
2022-08-03 23:10:31
,
所有人可见
,
阅读 114
C# 代码
public class Solution {
public int[][] Insert(int[][] intervals, int[] newInterval) {
int n = intervals.Length;
List<int[]> result = new List<int[]>();
int k = 0;
while (k < n && newInterval[0] > intervals[k][1]){
result.Add(intervals[k++]);
}
if (k < n){
newInterval[0] = Math.Min(newInterval[0], intervals[k][0]);
while (k < n && newInterval[1] >= intervals[k][0]){
newInterval[1] = Math.Max(newInterval[1], intervals[k][1]);
k++;
}
}
result.Add(newInterval);
while (k < n) result.Add(intervals[k++]);
return result.ToArray();
}
}