【leetcode】35. Search Insert Position

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

给定排序的数组，然后找到插入的位置。

int solution::searchInsert(vector<int>& nums, int target){

	vector<int>::iterator begin = nums.begin();
	vector<int>::iterator end = nums.end();

	int result = 0;
	for (auto it = begin; it != end; ++it)
	{
		if (*it < target)
		{
			result++;
		}
		else
		{
			break;
		}
	}

	return result;
}