[leetcode]-35. Search Insert Position（C语言）

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 1:

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

编写过程中遇到了如下错误：

error: stray '\357' in program

这种情况是将分号写成了中文，在报错行改成英文分号即可。

代码如下：

int searchInsert(int* nums, int numsSize, int target) {
    int i,j,k;
    for(i=0;i<numsSize;i++)
    {
        if(nums[i]>=target)
            return i;
    }
    return i;
}