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

add curly braces and comments to advoid confusion

Browse Source
This commit is contained in:
mengyi
2024-06-05 19:08:31 -04:00
parent 06a26f47f1
commit b5a5340d1a
1 changed files with 14 additions and 6 deletions
Download Patch File Download Diff File Expand all files Collapse all files

20
problems/0704.二分查找.md
View File

@ -174,13 +174,17 @@ class Solution {
int left = 0, right = nums.length - 1; int left = 0, right = nums.length - 1;
while (left <= right) { while (left <= right) {
int mid = left + ((right - left) >> 1); int mid = left + ((right - left) >> 1);
if (nums[mid] == target) if (nums[mid] == target) {
return mid; return mid;
else if (nums[mid] < target) }
else if (nums[mid] < target) {
left = mid + 1; left = mid + 1;
else if (nums[mid] > target) }
else { // nums[mid] > target
right = mid - 1; right = mid - 1;
}
} }
// 未找到目标值
return -1; return -1;
} }
} }
@ -194,13 +198,17 @@ class Solution {
int left = 0, right = nums.length; int left = 0, right = nums.length;
while (left < right) { while (left < right) {
int mid = left + ((right - left) >> 1); int mid = left + ((right - left) >> 1);
if (nums[mid] == target) if (nums[mid] == target) {
return mid; return mid;
else if (nums[mid] < target) }
else if (nums[mid] < target) {
left = mid + 1; left = mid + 1;
else if (nums[mid] > target) }
else { // nums[mid] > target
right = mid; right = mid;
}
} }
// 未找到目标值
return -1; return -1;
} }
} }