Search Insert Position

最新推荐文章于 2019-05-31 00:39:10 发布

原创最新推荐文章于 2019-05-31 00:39:10 发布 · 312 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

收录于

LEETCODE 专栏收录该内容

9 篇文章

订阅专栏

本文介绍了一个简单的算法，用于在一个已排序的数组中找到特定目标值的插入位置。该算法通过遍历数组直到找到合适的位置来实现，适用于没有重复元素的情况。文章提供了C++实现示例。

Search Insert Position

Total Accepted: 26622 Total Submissions: 76002 My Submissions

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

//Search Insert Position

#include<iostream>

using namespace std;

class Solution {
public:
    int searchInsert(int A[], int n, int target) {
		int i = 0;
		while(A[i] < target && i < n)
		{
			++i;
		}
		return i;
    }
};

int
main(void)
{
	Solution sn;
	int arr[] = {1};
	int n = 1;
	int tgt;
	cin >> tgt;
	cout << sn.searchInsert(arr,n,tgt);
	return 0;
}