题解 | #二分查找-I#
二分查找-I
https://www.nowcoder.com/practice/d3df40bd23594118b57554129cadf47b
/** * 代码中的类名、方法名、参数名已经指定,请勿修改,直接返回方法规定的值即可 * * * @param nums int整型一维数组 * @param numsLen int nums数组长度 * @param target int整型 * @return int整型 */ int search(int* nums, int numsLen, int target ) { // write code here if (nums == NULL) return -1; int begin = 0; int end = numsLen - 1; int mid = 0; while (begin <= end) { mid = (begin + end) / 2; if (target == nums[mid]) { return mid; } else if (target < nums[mid]) { end = mid - 1; } else { begin = mid + 1; } } return -1; }