LeetCode35-搜索插入位置
LeetCode35-搜索插入位置
二分查找
| public int searchInsert(int[] nums, int target) { int n = nums.length; int left = 0, right = n - 1; while (left <= right) { int mid = ((right - left) >> 1) + left; if (target <= nums[mid]) { right = mid - 1; } else { left = mid + 1; } } return left; }
|