7 lines Java, less than 1 ms.


  • 0
    G
    public int searchInsert(int[] nums, int target) {
        for (int i =0; i < nums.length; i++) {
            if (nums[i] < target) continue;
            return i;
        }
        return nums.length;
    }

Log in to reply
 

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