algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-09 03:34:02 +08:00
Code Issues Packages Projects Releases Wiki Activity

Update 0056.合并区间.md

Browse Source 
Update Java solution. For sorting, no need to compare the second element in an interval.
This commit is contained in:
Yang
2021-06-01 14:41:22 -04:00
committed by GitHub
parent 7b3f8ea4dd
commit 67313906d1
1 changed files with 1 additions and 5 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
problems/0056.合并区间.md
View File

@ -144,11 +144,7 @@ class Solution {
Arrays.sort(intervals, new Comparator<int[]>() { Arrays.sort(intervals, new Comparator<int[]>() {
@Override @Override
public int compare(int[] o1, int[] o2) { public int compare(int[] o1, int[] o2) {
if (o1[0] != o2[0]) { return Integer.compare(o1[0], o2[0]);
return Integer.compare(o1[0],o2[0]);
} else {
return Integer.compare(o1[1],o2[1]);
}
} }
}); });