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 searchInsert(vector<int>& nums, int target) {
		int length = nums.size();
		int i = 0;
		if (length == 0)
			return 0;
		for (i=0; i<length; i++)
		{
			if (nums[i] >= target)
				break;
		}
		return i;
	}