Leetcode 33. 搜索旋转排序数组 (Day 23) JavaScript

varsearch=function(nums,target){letleft=0,right=nums.length-1;while(left<=right){constmid=left+Math.floor((right-left)/2);if(nums[mid]===target)returnmid;// 左半段有序if(nums[left]<=nums[mid]){// target 在 [nums[left], nums[mid-1]] 内if(nums[left]<=target&&target<nums[mid]){right=mid-1;}else{// target 在右半边left=mid+1;}}// 右半段有序else{// target 在 [nums[mid+1], nums[right]] 内if(nums[mid]<target&&target<=nums[right]){left=mid+1;}else{// target 在左半边right=mid-1;}}}return-1;};