摘要： class Solution { public: bool search(vector& nums, int target) { int low=0; int high=nums.size()-1; //整个数组是分段递增的 while(lownums[mid]) low=mid+1;... 阅读全文