35. Search Insert Position

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.

Example 1:

Input: [1,3,5,6], 5
Output: 2

Example 2:

Input: [1,3,5,6], 2
Output: 1

Example 3:

Input: [1,3,5,6], 7
Output: 4

Example 1:

Input: [1,3,5,6], 0
Output: 0

解析

// 35. Search Insert Position
class Solution_35 {
public:
	int searchInsert1(vector<int>& nums, int target) {

		int low = 0, high = nums.size() - 1;
		while (low<=high)
		{
			int mid = (low + high) >> 1;
			if (nums[mid]==target)
			{
				return mid;
			}
			else if (nums[mid]>target)
			{
				high = mid - 1;
			}
			else
			{
				low = mid + 1;
			}
		}
		return low; //没有查找到，返回的low,即插入位置
	}

	int searchInsert(int A[], int n, int target) {
		vector<int> vec(A, A + n);
		return searchInsert1(vec, target);
	}
};

题目来源

• 35. Search Insert Position