「搜索左侧边界」的二分搜索算法的具体代码实现如下：

    1. // 搜索左侧边界
    2. int left_bound(int[] nums, int target) {
    3.     if (nums.length == 0) return -1;
    4.     int left = 0, right = nums.length;
    6.     while (left < right) {
    7.         int mid = left + (right - left) / 2;
    8.         if (nums[mid] == target) {
    9.             // 当找到 target 时，收缩右侧边界
    10.             right = mid;
    11.         } else if (nums[mid] < target) {
    12.             left = mid + 1;
    13.         } else if (nums[mid] > target) {
    14.             right = mid;
    15.         }
    16.     }
    17.     return left;
    18. }

    「搜索右侧边界」的二分搜索算法的具体代码实现如下：

    1. // 搜索右侧边界
    2. int right_bound(int[] nums, int target) {
    3.     if (nums.length == 0) return -1;
    4.     int left = 0, right = nums.length;
    6.     while (left < right) {
    7.         int mid = left + (right - left) / 2;
    8.         if (nums[mid] == target) {
    9.             // 当找到 target 时，收缩左侧边界
    10.             left = mid + 1;
    11.         } else if (nums[mid] < target) {
    12.             left = mid + 1;
    13.         } else if (nums[mid] > target) {
    14.             right = mid;
    15.         }
    16.     }
    17.     return left - 1;    //return right - 1;
    18. }