Leetcode 34. 在排序数组中查找元素的第一个和最后一个位置（DAY 96） ---- Leetcode Hot 100

---

原题题目

---

---

代码实现（首刷自解）

---

class Solution {
public:
    vector<int> searchRange(vector<int>& nums, int target) {
        vector<int> ret;
        auto startpos = lower_bound(nums.begin(),nums.end(),target);
        if(startpos == nums.end() || *startpos != target)
        {
            ret.emplace_back(-1);
            ret.emplace_back(-1);
        }
        else
        {
            ret.emplace_back(startpos - nums.begin());
            ret.emplace_back(upper_bound(nums.begin(),nums.end(),target) - nums.begin()-1);
        }
        return ret;
    }
};

---

代码实现（二刷自解 C++ DAY 161）

---

class Solution {
public:
    vector<int> searchRange(vector<int>& nums, int target) {
        vector<int> ret{-1,-1};
        auto index = lower_bound(nums.begin(),nums.end(),target);
        if(index == nums.end() || *index != target) return ret;
        ret[0] = index-nums.begin();
        index = upper_bound(index,nums.end(),target);
        ret[1] = index-nums.begin()-1;
        return ret;
    }
};

---

代码实现（二刷自解 自定义lower upper bound C++ DAY 231）

---

class Solution {
public:
    int my_lower_bound(vector<int>& nums,int target)
    {
        if(nums.empty())    return -1;
        int l = 0,r = nums.size()-1;
        while(l < r)
        {
            int mid = l + ((r - l) >> 1);
            if(nums[mid] < target)  l = mid + 1;
            else                    r = mid;
        }

        return nums[l] == target ? l : -1;
    }

    int my_upper_bound(vector<int>& nums,int target)
    {
        if(nums.empty())    return -1;
        int l = 0,r = nums.size()-1;
        while(l < r)
        {
            int mid = l + 1 + ((r - l) >> 1);
            if(nums[mid] > target) r = mid - 1;
            else                   l = mid;
        }
        return nums[l] == target ? l : -1;
    }

    vector<int> searchRange(vector<int>& nums, int target) {
        return {my_lower_bound(nums,target),my_upper_bound(nums,target)};
    }
};

---

代码实现（三刷自解 DAY 290 C++）

---

class Solution {
 public:
  int my_lower_bound(vector<int>& nums, int target) {
    int left = 0, right = nums.size();
    while (left < right) {
      int mid = left + ((right - left) >> 1);
      if (nums[mid] < target) left = mid + 1;
      else right = mid;  
    }
    return left;
  }

  int my_upper_bound(vector<int>& nums, int target) {
    int left = 0, right = nums.size();
    while (left < right) {
      int mid = left + ((right - left) >> 1);
      if (nums[mid] <= target) left = mid + 1;
      else right = mid;  
    }
    return left;
  }

  vector<int> searchRange(vector<int>& nums, int target) {
    vector<int> ret{-1, -1};
    int startpos = my_lower_bound(nums, target);
    if (startpos == nums.size() || nums[startpos] != target) {
      return ret;
    }
    ret[0] = startpos;
    ret[1] = my_upper_bound(nums, target) - 1;

    return ret;
  }
};

---

代码实现（四刷自解 DAY 8 Golang）

---

func upperbound(nums []int, target int) int {
  left, right := 0, len(nums)
  for left < right {
    mid := ((right - left) >> 1) + left
    if nums[mid] <= target {
      left = mid + 1
    } else {
      right = mid
    }
  }
  return left
}

func lowerbound(nums []int, target int) int {
  left, right := 0, len(nums)
  for left < right {
    mid := ((right - left) >> 1) + left
    if nums[mid] < target {
      left = mid + 1
    } else {
      right = mid
    }
  }
  if left == len(nums) || nums[left] != target {
    return -1
  }
  return left
}

func searchRange(nums []int, target int) []int {
  left, right := lowerbound(nums, target), upperbound(nums, target)

  if left == -1 {
    return []int{-1, -1}
  }

  return []int{left, right - 1}
}