35. Search Insert Position

easy
最后返回的是nums.length

 

 

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