Method binarySearchRight

java/1095-find-in-mountain-array.java:52–68

(MountainArray array, int target, int left)

    }

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

        while (left <= right) {
            int mid = left + (right - left)/2;
            int midValue = array.get(mid);

            if (midValue < target) {
                right = mid - 1;
            } else if (midValue > target) {
                left = mid + 1;
            } else {
                return mid;
            }
        }
        return -1;
    }
}