Search in Rotated Sorted Array ||
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.
Follow up for "Search in Rotated Sorted Array":
What
if duplicates are allowed?
Would this affect the run-time complexity? How and why?
Write a function to determine if a given target is in the array.
public class Solution { public boolean search(int[] A, int target) { int len = A.length; int l = 0; int r = len -1; while(l <= r){ int m = (l+r)/2; if(target == A[m]){ return true; } if( A[m] < A[l]){ // higher is sorted if(target > A[m] && target <= A[r]){ l = m+1; }else{ r = m-1; } }else if(A[m] > A[l]){ if(target >= A[l] && target < A[m]){ r = m-1; }else{ l = m+1; } }else{ // A[m] == A[l] l++; } } return false; } }
[Leetcode]-- Search in Rotated Sorted Array ||
原文：http://www.cnblogs.com/RazerLu/p/3535770.html