[LeetCode] 56. Merge Intervals

Link : https://leetcode.com/problems/merge-intervals/description/ 문제 설명 Given an array of intervals where intervals[i] = [start_i, end_i], merge all overlapping intervals, and return an array of the non-overlapping intervals that...