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