-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathleetcode33.java
More file actions
31 lines (30 loc) · 892 Bytes
/
Copy pathleetcode33.java
File metadata and controls
31 lines (30 loc) · 892 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
package leetcode.binarySearch;
public class leetcode33 {
public int search(int[] nums, int target) {
int left=0;
int right=nums.length-1;
int mid=(left+right)/2; //中点
while(left<=right){
if(nums[mid]==target){
return mid;
}
if(nums[left]<=nums[mid]) //右边升序
{
if(target>=nums[left]&& target<nums[mid]){
right=mid-1;
}
else{
left=mid+1; //只能从右边找
}
}else{ //左边升序
if(target>nums[mid]&& target<=nums[right]){
left=mid+1;
}else{
right=mid-1; //只能从左边找
}
}
mid=(left+right)/2;
}
return -1; //没找到
}
}