字节跳动2018年校招后端方向

第四题
这是我认为比较满意的修改了

    private static int BinarySearchMax(int[] arr, int target){
        int left = 0;
        int right = arr.length - 1;  //第一处修改
        int index = -1;

        while(right >= left){  //第二处修改
            int mid = left + (right - left) / 2;  //第三处修改

            if(arr[mid] == target){  //第四处修改
                index = mid;         //第五处修改
                left = mid + 1;
            }else if(arr[mid] < target){
                left = mid + 1;
            }else{
                right = mid - 1;
            }

        }

        if(arr[right] == target){
            return right;
        }

        return index;
    }