力扣-35.搜索插入位置

题目链接

35.搜索插入位置

class Solution {public int searchInsert(int[] nums, int target) {int low = 0, high = nums.length - 1;while (low <= high) {int mid = (low + high) / 2;if (nums[mid] > target) {high = mid - 1;} else if (nums[mid] < target) {low = mid + 1;} else {return mid;}}return low;}
}

小结：注意边界值可以秒。