35. Search Insert Position

problem：

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
顺序循环，当小于target的时候，指针后移，当等于或大于的时候，返回当前位置。若一直循环到最后都没有，则放在后一位即可。
class Solution {
public:
int searchInsert(vector<int>& nums, int target) {
int result;
int length = nums.size();
int i = 0;
while(i < length)
{
if(nums[i] < target)
i++;
else
{
result = i;
break;
}
}
if(i == length)
result = i;
return result;
}
};