algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-09 19:44:45 +08:00
Code Issues Packages Projects Releases Wiki Activity

更新0704.二分查找,java版本

Browse Source
This commit is contained in:
HuJian
2021-05-19 10:56:39 +08:00
parent cbdfb41dd8
commit 22bd2751f6
1 changed files with 4 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@ -153,6 +153,10 @@ Java：
```java ```java
class Solution { class Solution {
public int search(int[] nums, int target) { public int search(int[] nums, int target) {
// 避免当 target 小于nums[0] nums[nums.length - 1]时多次循环运算
if (target < nums[0] || target > nums[nums.length - 1]) {
return -1;
}
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);