Leetcode
2020.05.05 16:42

# 56. Merge Intervals

조회 수 368 추천 수 0 댓글 0
?

#### 단축키

Prev이전 문서

Next다음 문서

크게 작게 위로 아래로 댓글로 가기 인쇄
?

#### 단축키

Prev이전 문서

Next다음 문서

크게 작게 위로 아래로 댓글로 가기 인쇄

Given a collection of intervals, merge all overlapping intervals.

Example 1:

```Input: [[1,3],[2,6],[8,10],[15,18]]
Output: [[1,6],[8,10],[15,18]]
Explanation: Since intervals [1,3] and [2,6] overlaps, merge them into [1,6].
```

Example 2:

```Input: [[1,4],[4,5]]
Output: [[1,5]]
Explanation: Intervals [1,4] and [4,5] are considered overlapping.```

NOTE: input types have been changed on April 15, 2019. Please reset to default code definition to get new method signature.

```class Solution {
public int[][] merge(int[][] intervals) {
List<int[]> list = new ArrayList<>();

Collections.sort(Arrays.asList(intervals), Comparator.comparingInt(p -> p[0]));

if(intervals.length > 1){
for(int i=1; i<intervals.length; i++){
if(intervals[i-1][1] >= intervals[i][0]){
int min = Math.min(intervals[i-1][0], intervals[i][0]);
int max = Math.max(intervals[i-1][1], intervals[i][1]);

intervals[i-1][0] = intervals[i][0] = min;
intervals[i-1][1] = intervals[i][1] = max;
}else{
}
}
}
if(intervals.length > 0){
}

int[][] result = new int[list.size()][2];
for(int i=0; i<list.size(); i++){
int[] p = list.get(i);
result[i][0] = p[0];
result[i][1] = p[1];
}

return result;
}
}```

?

 제목+내용제목내용댓글이름닉네임아이디태그
1. 720. Longest Word in Dictionary

2. 225. Implement Stack using Queues

3. 56. Merge Intervals

4. 844. Backspace String Compare

5. 222. Count Complete Tree Nodes

6. 697. Degree of an Array

7. 605. Can Place Flowers

8. 724. Find Pivot Index

9. 448. Find All Numbers Disappeared in an Array

10. 628. Maximum Product of Three Numbers

11. 532. K-diff Pairs in an Array

12. 897. Increasing Order Search Tree

13. 872. Leaf-Similar Trees

14. 876. Middle of the Linked List

15. 203. Remove Linked List Elements

16. 997. Find the Town Judge

17. 270. Closest Binary Search Tree Value

18. 687. Longest Univalue Path

19. 783. Minimum Distance Between BST Nodes

20. 235. Lowest Common Ancestor of a Binary Search Tree

Board Pagination Prev 1 2 3 4 Next
/ 4