Search Insert Position - LeetCode

题目：

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.

时间比较紧，，选了一道特别简单的题目，

找到第一个大于等于target的数，返回这个数的位置就行

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();
}
};