1.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
2.題目要求：搜索插入位置沙热，即找出比當(dāng)前數(shù)字小的數(shù)字個(gè)數(shù)。
3.方法：遍歷一遍原數(shù)組赤炒，若當(dāng)前數(shù)字大于或等于目標(biāo)值镶摘，則返回當(dāng)前坐標(biāo)沟涨，如果遍歷結(jié)束了虐秦，說(shuō)明目標(biāo)值比數(shù)組中任何一個(gè)數(shù)都要大，則返回?cái)?shù)組長(zhǎng)度n即可
4.代碼：
class Solution {
public:
int searchInsert(vector<int>& nums, int target) {
for (int i = 0; i < nums.size(); ++i) {
if (nums[i] >= target) return i;
}
return nums.size();
}
};
