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

#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;

int searchInsert(int A[], int n, int target) {
	
	int begin = 0;
	int end   = n - 1;
	int mid   = (begin + end) / 2;
	while (begin<=end)
	{
		mid = (begin + end) / 2;
		if (A[mid] == target)
			return mid;
		else if (A[mid] < target)
			begin = mid+1;
		else
			end   = mid-1;
	}
	return begin;
}

Search Insert Position

标签：

原文地址：http://blog.csdn.net/li_chihang/article/details/44350113