class Solution {public: int search(vector<int>& nums, int target) { return(helper(nums, target, 0, nums.size() - 1)); } int helper(vector<int>& nums, int &target, int left, int right) { if(left > right || nums[left] > target || nums[right] < target) //边界检测 return -1;...