mirror of
https://github.com/youngyangyang04/leetcode-master.git
synced 2025-07-08 16:54:50 +08:00
Update 0056.合并区间.md
Simplify sorting
This commit is contained in:
@ -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++) {
|
||||
|
Reference in New Issue
Block a user