Short Java solution without Binary Search


  • 0
    A
    public int searchInsert(int[] nums, int target) {
            for(int i=0;i<nums.length;i++){
                if (nums[i]>=target){
                    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.