搜索旋转排序数组

/**
 * @param {number[]} nums
 * @param {number} target
 * @return {number}
 */
var search = function(nums, target) {
    // return nums.indexOf(target);
    let mid = 0;
    let left;
    let right;
    while(nums[mid]<nums[mid+1]) mid++;
    if(nums[mid]==target){
        return mid;
    }
    if(nums[mid]<target){

        return -1;
    }
    if(target <nums[mid]&target>=nums[0]){
         left = 0;
        right = mid;
    }else{
        if(target<nums[mid+1]){

            return -1;
        }
        left = mid +1;
        right = nums.length-1;
        
    }
    let middle;
    while(left<=right){
            middle =parseInt((left+right)/2);
            if(target== nums[middle]){
                return middle;
            }else if(target<nums[middle]){
                right = middle-1;
            }else{
                left = middle+1;
            }
        }
    if(left>right){
        return -1;
    }
   
    
};