力扣35-搜索插入位置

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