Search Insert Position

最新推荐文章于 2023-05-31 00:05:53 发布

原创最新推荐文章于 2023-05-31 00:05:53 发布 · 538 阅读

0 ·

CC 4.0 BY-SA版权

LeetCode 专栏收录该内容

113 篇文章

订阅专栏

本文介绍了如何在一个已排序的数组中查找目标值的正确索引，如果目标值不存在，则返回它应该插入的位置以保持数组的排序。此算法适用于没有重复元素的情况。

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;
}