LeetCode 35. Search Insert Position (Java)

题目：

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:

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

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

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

解答：

//直接进行依次对比即可
class Solution {
    public int searchInsert(int[] nums, int target) {
        if(nums.length==0)
            return 0;
        int k=0;
        for(int i=0;i<nums.length;i++){
            if(nums[i]<target){
                k++;
            }else{
                break;
            }
        }
        return k;
    }
}