左侧边界 1 int left_bound(int[] nums, int target) { 2 int left = 0, right = nums.length - 1; 3 // 搜索区间为 [left, right] 4 while (left <= right) { 5 int mid