Search Insert Position

最新推荐文章于 2025-12-07 14:43:47 发布

转载最新推荐文章于 2025-12-07 14:43:47 发布 · 294 阅读

文章标签：

#leetcode

本文介绍了一种在已排序数组中查找指定目标值的方法。若找到目标值，则返回其索引；若未找到，则返回目标值按序插入的位置。文章通过一个具体的C++类实现示例，展示了如何遍历数组来确定目标值的正确位置。

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

class Solution {
public:
int searchInsert(int A[], int n, int target) {
// Note: The Solution object is instantiated only once and is reused by each test case.
if (n==0)
return 0;
if (target<A[0])
return 0;

for (int i=0;i<n-1;i++){
if (target==A[i])
return i;
else if (target>A[i] && target<A[i+1])
return i+1;
}

if (target==A[n-1])
return n-1;
else
return n;
}
};