Search Insert Position
题目描述如下:<span style="font-size:12px;">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.
Here are few examples.
[1,3,5,6], 5 → 2
[1,3,5,6], 2 → 1
[1,3,5,6], 7 → 4
[1,3,5,6], 0 → 0</span>
题目非常简单,只要你能看懂题目,就是要找出一个目标数在数组中的下标位置,而且这个数组还是已经排好序的,那就简单啦,直接从开始遍历数组,看目标数是不是小于等于数组元素,如果是的话就返回该下标。如果遍历完数组都没有符合标准,那么也是返回现在的迭代下标值。
代码非常简单,都是直接在网页上写完提交就AC了,如下:
class Solution {
public:
int searchInsert(int A[], int n, int target) {
int i = 0;
for(; i < n; i++)
{
if(target <= A[i])
{
return i;
}
}
return i;
}
};