题解 | #在旋转过的有序数组中寻找目标值#

public class Solution {
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     * 
     * @param nums int整型一维数组 
     * @param target int整型 
     * @return int整型
     */
    public int search (int[] nums, int target) {
        // write code here
        if(nums == null || nums.length == 0){
            return -1;
        }
        if(nums.length == 1 && nums[0] != target){
            return -1;
        }
        int left = 0;
        int right = nums.length - 1;
        int mid = 0;
        while(right >= left){
            mid = (right - left) / 2 +left;
            if(nums[mid] == target){
                return mid;
            }
            if(nums[mid] >= nums[left] ){
                if(target < nums[mid] && target > nums[left]){
                    right = mid - 1;
                }else{
                    left = mid +1;
                }
            }else {
                if(target  > nums[mid] && target < nums[left]){
                    left = mid +1;
                }else{
                    right = mid - 1;
                }
            }
        }
        return -1;
    }
}