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