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

Merge pull request #310 from yang170/patch-2

Browse Source 
Update 0056.合并区间.md
This commit is contained in:
Carl Sun
2021-06-02 20:42:31 +08:00
committed by GitHub
parent ad650370c1 f4736c7dd2
commit 405463df9e
1 changed files with 1 additions and 10 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

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