Skip to content

Commit 1f703f9

Browse files
committed
note
1 parent 83d128d commit 1f703f9

2 files changed

Lines changed: 2 additions & 2 deletions

File tree

‎src/main/java/com/chen/algorithm/znn/array/test56/Solution.java‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -88,7 +88,7 @@ public int[][] merge1(int[][] intervals) {
8888
if (merged.size() == 0 || merged.get(merged.size() - 1)[1] < L) {
8989
merged.add(new int[]{L, R});
9090
} else {
91-
merged.get(merged.size() - 1)[1] = Math.max(merged.get(merged.size() - 1)[1], R);
91+
merged.get(merged.size() - 1)[1] = Math.max(merged.get(merged.size() - 1)[1], R); // 已经排过序,不需要比对起始值
9292
}
9393
}
9494
return merged.toArray(new int[merged.size()][]);

‎src/main/java/com/chen/algorithm/znn/note‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -84,7 +84,7 @@ array
8484
283. 移动零 双指针(方法同27题移除元素)
8585
34. 在排序数组中查找元素的第一个和最后一个位置 二分查找
8686
56. 合并区间 排序
87-
69. x 的平方根 *** 二分法
87+
69. x 的平方根 *** 二分法与50题Pow(x, n)相对应
8888
88. 合并两个有序数组 *** p1,p2,p3=p1+p2
8989
238. 除自身以外数组的乘积 先求出左右两边的乘积再相乘
9090
240. 搜索二维矩阵 II 从左下角开始

0 commit comments

Comments
 (0)