35. Search Insert Position

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