Class Solution1

problems/0035-search-insert-position/Code/1.java:1–11

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