Method binarySearchLeft

java/1095-find-in-mountain-array.java:35–50

(MountainArray array, int target, int right)

    }

    public int binarySearchLeft(MountainArray array, int target, int right) {
        int left = 0;

        while (left<=right) {
            int mid = left + (right - left)/2;
            int midValue = array.get(mid);
            if (midValue < target) {
                left = mid + 1;
            } else if (midValue > target) {
                right = mid - 1;
            } else {
                return mid;
            }
        }
        return -1;
    }

    public int binarySearchRight(MountainArray array, int target, int left) {
        int right = array.length() - 1;