leetcode 34. 在排序数组中查找元素的第一个和最后一个位置

虽然只是一道中等难度的题目，但是看了官方的解答，有很精彩的地方，但是总体代码写得不算优雅。

class Solution {
   
    // returns leftmost (or rightmost) index at which `target` should be
    // inserted in sorted array `nums` via binary search.
    private int extremeInsertionIndex(int[] nums, int target, boolean left) {
   
        int lo = 0;
        int hi = nums.length;

        while (lo < hi) {
   
            int mid = (lo + hi) / 2;
            if (nums[mid] > target || (left && target == nums[mid])) {
   
                hi = mid;
            }
            else {
   
                lo = mid+1;
            }
        }

        return lo;
    }

    public int[] searchRange(int[] nums, int target) {
   
        int[] targetRange = {
   -1, -1};

        int leftIdx = extremeInsertionIndex(nums, target,