[LeetCode] 56. Merge Intervals - Java
·
알고리즘/LeetCode
https://leetcode.com/problems/merge-intervals/description/ Merge Intervals - LeetCode Merge Intervals - Given an array of intervals where intervals[i] = [starti, endi], merge all overlapping intervals, and return an array of the non-overlapping intervals that cover all the intervals in the input. Example 1: Input: intervals = [[1,3],[2 leetcode.com 문제 Given an array of intervals where intervals[..