Java Solution


  • 0
    W

    class Solution {
    public int searchInsert(int[] nums, int target) {
    int i = 0;
    for(int j = 0; j<nums.length; j++){
    if(nums[j] < target){i++;}
    }
    return i;
    }
    }


Log in to reply
 

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