[leetcode] 81. Search in Rotated Sorted Array II classSolution {public:boolsearch(vector<int>& nums,inttarget) {intlow=0;inthigh=nums.size()-1;//整个数组是分段递增的while(low<high){intmid=(low+high)/2;if(nums[mid]==target)returntrue;if(nums[mid]<nums[high]){//说明分界点在前半...