We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see ourdocumentation.
There was an error while loading.Please reload this page.
1 parent4036244 commit7211974Copy full SHA for 7211974
src/main/java/com/fishercoder/solutions/_56.java
@@ -12,7 +12,7 @@ public static class Solution1 {
12
*/
13
publicint[][]merge(int[][]intervals) {
14
List<int[]>list =newArrayList<>();
15
-Arrays.sort(intervals, (a,b) ->Integer.compare(a[0],b[0]));//to avoid integer subtraction overflow
+Arrays.sort(intervals, (a,b) ->a[0] !=b[0] ?Integer.compare(a[0],b[0]) :Integer.compare(b[1],a[1]));//to avoid integer subtraction overflow
16
for (inti =0;i <intervals.length;i++) {
17
intstart =intervals[i][0];
18
intend =intervals[i][1];
@@ -22,11 +22,7 @@ public int[][] merge(int[][] intervals) {
22
}
23
list.add(newint[]{start,end});
24
25
-int[][]ans =newint[list.size()][2];
26
-for (inti =0;i <list.size();i++) {
27
-ans[i] =list.get(i);
28
- }
29
-returnans;
+returnlist.toArray(newint[list.size()][2]);
30
31
32