题目:Search in Rotated Sorted Array
难度:hard
问题描述:
Suppose a sorted array is rotated at some pivot unknown to you beforehand.
(i.e., 0 1 2 4 5 6 7
might become 4 5 6 7 0 1 2
).
You are given a target value to search. If found in the array return its index, otherwise return -1.
You may assume no duplicate exists in the array.
解题思路:与34、35题一样(我是先做的后两道medium题~),使用分治算法,每次取mid,不过,取完mid后的判断要复杂一些,但也很容易。同样十分简单,在此不再赘述。具体代码如下:
public class Solution {
public int search(int[] nums, int target) {
int l=0,r=nums.length-1;
while(l<=r){
int mid=(r-l)/2+l;//中间偏右的位置
if(nums[mid]==target){
return mid;
}
if(nums[mid]