SearchRotationSortingArray题目描述：整数数组nums按升序排列，数组中的值互不相同。在传递给函数之前，nums在一个未知的下标k(0<=knums[i+1]){maxIndx=i;休息;}}if(target<=nums[nums.length-1]){returnfind(nums,maxIndx+1,nums.length-1,target);}else{returnfind(nums,0,maxIndx,target);}}/***二分查找*@paramnums*@paramleft*@paramright*@paramtarget*@return*/publicstaticintfind(int[]nums,intleft,intright,inttarget){int中;while(left<=right){mid=(left+right)/2;如果(nums[mid]==目标){返回中间;}elseif(nums[mid]
