35. Search Insert Position

Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order.

You may assume no duplicates in the array.

Example 1:

Input: [1,3,5,6], 5
Output: 2
Example 2:

Input: [1,3,5,6], 2
Output: 1
Example 3:

Input: [1,3,5,6], 7
Output: 4
Example 4:

Input: [1,3,5,6], 0
Output: 0

来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/search-insert-position
著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。

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

来源：CSDN

作者：csdnzhaocsdn

链接：https://blog.csdn.net/qq_39360744/article/details/104080921