Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commit 2c08a09

Browse files
✨update: Modify 373
1 parent f39aaf4 commit 2c08a09

File tree

1 file changed

+2
-2
lines changed

1 file changed

+2
-2
lines changed

‎LeetCode/371-380/373. 查找和最小的K对数字(中等).md‎

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -193,7 +193,7 @@ class Solution {
193193
List<List<Integer>> ans = new ArrayList<>();
194194
int l = nums1[0] + nums2[0], r = nums1[n - 1] + nums2[m - 1];
195195
while (l < r) {
196-
int mid = l + r >> 1;
196+
int mid = (int)(0L+l + r >> 1);
197197
if (check(mid, k)) r = mid;
198198
else l = mid + 1;
199199
}
@@ -212,7 +212,7 @@ class Solution {
212212
int c = -1, d = -1;
213213
l = 0; r = m - 1;
214214
while (l < r) {
215-
int mid = l + r >> 1;
215+
int mid = (int)(0L+l + r >> 1);
216216
if (nums2[mid] >= b) r = mid;
217217
else l = mid + 1;
218218
}

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /