Leetcodes Solution 34 Search for a Range

zhuanlan.zhihu.com

思路1

用二分搜索分別找到最小和最大的索引

Search for a Range - LeetCode

class Solution{public: vector<int> searchRange(vector<int>& nums, int target){ int n = nums.size(); int i = 0, j = n-1; vector<int> ret(2, -1); if (n == 0) return ret; //Search for the left one while(i < j){ int mid = (i + j) / 2; if(nums[mid] < target) i = mid + 1; else j = mid; } if(nums[i] != target) return ret; else ret[0] = i; //Search for the right one j = n-1; //we dont have to set i to 0 the seond time. while(i < j){ int mid = (i + j) / 2 + 1; //make mid biase to the right if(nums[mid] > target) j = mid - 1; else i = mid; } ret[1] = j; return ret; }};

推薦閱讀：