算法不对 class Solution { public: int search(vector<int>&; nums, int target) { int i = 0, j = nums.size(); while(i < j){ int mid = i + ((j -i)>>1); if(nums[mid] == target) return mid; if(nums[i] <= nums[mid]){ if(nums[i] <= target &;&; target < nums[mid]) j = mid; else i = mid + 1; } else{ if(nums[mid] < target &;&; target <= nums[j - 1]) i = mid + 1; else j = mid ; } } return -1; } };