35. Search Insert Position.java

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