mirror of
https://github.com/youngyangyang04/leetcode-master.git
synced 2025-07-09 11:34:46 +08:00
Merge pull request #2578 from MengyiG/mengyi704
Update problem 704 Java solution and comments
This commit is contained in:
@ -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;
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
Reference in New Issue
Block a user