SearchInRotatedSortedArray.java

//Given the array nums after the possible rotation and an integer target, 
// return the index of target if it is in nums, or -1 if it is not in nums.
public class SearchInRotatedSortedArray {
	public int search(int[] nums, int target) {
        if(nums==null||nums.length==0) return -1;
        int left=0;
        int right=nums.length-1;
        while(left<right){
            int mid=left+(right-left)/2;
            if(nums[mid]>nums[right])
                left=mid+1;
            else
                right=mid;
        }
        
        int start=left;
        left=0;
        right=nums.length-1;
        if(target>=nums[start]&&target<=nums[right])
            left=start;
        else
            right=start;
        
        while(left<=right){
            int mid=left+(right-left)/2;
            if(nums[mid]==target)
                return mid;
            else if(nums[mid]<target)
                left=mid+1;
            else
                right=mid-1;
        }
        return -1;
    }

}