yggcyi
11/20/2017 - 12:07 PM
search test
You are given a target value to search. If found in the array return its index, otherwise return -1.
public int search(int[] nums, int target) {
int left = 0;
int right = nums.length - 1;
while(left <= right) {
int mid = left + (right - left) / 2;
if(nums[mid] == target) return mid;
if(nums[left] <= nums[mid]) {
if(target < nums[mid] && target >= nums[left])
right = mid - 1;
else
left = mid + 1;
}
if(nums[mid] <= nums[right]) {
if(target > nums[mid] && target <= nums[right])
left = mid + 1;
else
right = mid - 1;
}
}
return -1;
}