The simplest Java solution [2 lines]


  • 0

    Re: My 8 line Java solution

    Here is the code:
    public int searchInsert(int[] nums, int target) {
    int pos = Arrays.binarySearch(nums, target);
    return pos >= 0 ? pos : -pos - 1;
    }

    The trick is to use Java's standard Arrays function, check this out:
    binarySearch
    public static int binarySearch(int[] a,int key)
    Searches the specified array of ints for the specified value using the binary search algorithm. The array must be sorted (as by the sort(int[]) method) prior to making this call. If it is not sorted, the results are undefined. If the array contains multiple elements with the specified value, there is no guarantee which one will be found.

    Parameters:
    a - the array to be searched
    key - the value to be searched for

    Returns:
    index of the search key, if it is contained in the array; otherwise, (-(insertion point) - 1). The insertion point is defined as the point at which the key would be inserted into the array: the index of the first element greater than the key, or a.length if all elements in the array are less than the specified key. Note that this guarantees that the return value will be >= 0 if and only if the key is found.

    The official document is avaliable here.


Log in to reply
 

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.