[LeetCode] 56. 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