题解 | #二分查找-I#
二分查找-I
https://www.nowcoder.com/practice/d3df40bd23594118b57554129cadf47b
class Solution { public: /** * 代码中的类名、方法名、参数名已经指定,请勿修改,直接返回方法规定的值即可 * * * @param nums int整型vector * @param target int整型 * @return int整型 */ int search(vector<int>& nums, int target) { int l = 0; int r = nums.size()-1; while (l<=r) { int m = (l+r)/2; if(nums[m]==target) return m; if (nums[m]>target) r = m-1; if(nums[m]<target) l = m+1; } return -1; // write code here } };
注意size()函数的应用