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

Improve comparison

Browse Source
This commit is contained in:
Yang
2021-06-01 14:48:52 -04:00
committed by GitHub
parent 838e290312
commit f4736c7dd2
1 changed files with 1 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@ -141,7 +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, (o1, o2) -> o1[0] - o2[0]); Arrays.sort(intervals, (o1, o2) -> Integer.compare(o1[0], o2[0]));
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++) {