Update 0056.合并区间.md

Simplify sorting
This commit is contained in:
Yang
2021-06-01 14:46:19 -04:00
committed by GitHub
parent 67313906d1
commit 838e290312

View File

@ -141,12 +141,7 @@ Java
class Solution {
public int[][] merge(int[][] intervals) {
List<int[]> res = new LinkedList<>();
Arrays.sort(intervals, new Comparator<int[]>() {
@Override
public int compare(int[] o1, int[] o2) {
return Integer.compare(o1[0], o2[0]);
}
});
Arrays.sort(intervals, (o1, o2) -> o1[0] - o2[0]);
int start = intervals[0][0];
for (int i = 1; i < intervals.length; i++) {