leetcode 81. Search in Rotated Sorted Array II

class Solution {public:bool search(vector<int>& nums, int target){if (nums.empty()){return false;}int left = 0, right = nums.size() - 1;while (left < right){int mid = (left + right) / 2;if (nums[mid] == target){return true;}else{if (nums[mid] > nums[right]){if (nums[mid] > target && target >= nums[left]){right = mid;}else{left = mid + 1;}}else if (nums[mid] < nums[right]){if (nums[mid] < target && target <= nums[right]){left = mid + 1;}else{right = mid;}}else{right--;}}}return nums[left] == target;}};