Leetcode
2020.05.05 16:42

56. Merge Intervals

조회 수 529 추천 수 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{
                    list.add(intervals[i-1]);
                }
            }
        }
        if(intervals.length > 0){
            list.add(intervals[intervals.length-1]);
        }
        
        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;
    }
}


[문제] https://leetcode.com/problems/merge-intervals/



?

List of Articles
번호 분류 제목 글쓴이 날짜 조회 수
77 Leetcode 720. Longest Word in Dictionary hooni 2020.05.07 668
76 Leetcode 697. Degree of an Array hooni 2020.05.05 628
75 Leetcode 783. Minimum Distance Between BST Nodes hooni 2020.05.01 584
74 Leetcode 532. K-diff Pairs in an Array hooni 2020.05.04 570
73 Leetcode 687. Longest Univalue Path hooni 2020.05.01 570
72 Leetcode 235. Lowest Common Ancestor of a Binary Search Tree file hooni 2020.05.01 570
71 Leetcode 225. Implement Stack using Queues hooni 2020.05.05 569
70 Leetcode 997. Find the Town Judge hooni 2020.05.02 562
69 Leetcode 724. Find Pivot Index hooni 2020.05.05 560
68 Leetcode 222. Count Complete Tree Nodes hooni 2020.05.05 553
67 Leetcode 605. Can Place Flowers hooni 2020.05.05 541
66 Leetcode 844. Backspace String Compare hooni 2020.05.05 538
65 Leetcode 897. Increasing Order Search Tree hooni 2020.05.04 538
» Leetcode 56. Merge Intervals hooni 2020.05.05 529
63 Leetcode 872. Leaf-Similar Trees file hooni 2020.05.04 527
62 Leetcode 628. Maximum Product of Three Numbers hooni 2020.05.05 517
61 Leetcode 876. Middle of the Linked List hooni 2020.05.04 515
60 Leetcode 448. Find All Numbers Disappeared in an Array hooni 2020.05.05 510
59 Leetcode 203. Remove Linked List Elements hooni 2020.05.04 501
58 Leetcode 270. Closest Binary Search Tree Value hooni 2020.05.01 494
Board Pagination Prev 1 2 3 4 Next
/ 4