classSolution { public: intsearch(vector<int>& nums, int target){ /* 搜索右边界 right */ int i = 0, j = nums.size() - 1; while(i <= j) { int m = (i + j) / 2; if(nums[m] <= target) i = m + 1; else j = m - 1; } int right = i; /* 若数组中无 target ,则提前返回 */ if(j >= 0 && nums[j] != target) return0; /* 搜索左边界 right */ i = 0; j = nums.size() - 1; while(i <= j) { int m = (i + j) / 2; if(nums[m] < target) i = m + 1; else j = m - 1; } int left = j; return right - left - 1; } };