✉️문제
https://leetcode.com/problems/insert-interval/description/
Insert Interval - LeetCode
Can you solve this real interview question? Insert Interval - You are given an array of non-overlapping intervals intervals where intervals[i] = [starti, endi] represent the start and the end of the ith interval and intervals is sorted in ascending order b
leetcode.com
🗝 문제풀이
겹치는 부분의 조건을 확인하고 겹칠 때 마다 newInterval을 업데이트 한다.
class Solution {
public int[][] insert(int[][] intervals, int[] newInterval) {
List<int[]> res = new ArrayList<>();
for(int i = 0; i < intervals.length; i++) {
if(newInterval[1] < intervals[i][0]) {
res.add(new int[] {newInterval[0], newInterval[1]});
for(int j = i; j < intervals.length; j++) {
res.add(intervals[j]);
}
return toArray(res);
} else if(intervals[i][1] < newInterval[0]) {
res.add(new int[] {intervals[i][0], intervals[i][1]});
} else { // 겹치는 경우
int left = Math.min(intervals[i][0], newInterval[0]);
int right = Math.max(intervals[i][1], newInterval[1]);
newInterval = new int[] {left, right};
}
}
res.add(newInterval);
return toArray(res);
}
private static int[][] toArray(List<int[]> res) {
int[][] answer = new int[res.size()][2];
for (int i = 0; i < res.size(); i++) {
answer[i] = res.get(i);
}
return answer;
}
}