原题:
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
翻译:
给定排序数组和目标值,如果找到目标,则返回索引。
如果没有,请返回索引按顺序插入的索引。
您可以假设数组中没有重复项。
例 1:
输入: [1,3,5,6], 5
输出: 2
例 2:
输入: [1,3,5,6], 2
输出: 1
例 3:
输入: [1,3,5,6], 2
输出: 1
例 4:
输入: [1,3,5,6], 2
输出: 1
C程序
int searchInsert(int* nums, int numsSize, int target){
if(numsSize==0)return 0;
for(int i=0;i<numsSize;++i)
{
if(nums[i]==target||nums[i]>target)return i;
}
return numsSize;
}