LeetCode——Search Insert Position

最新推荐文章于 2025-08-12 12:49:47 发布

原创最新推荐文章于 2025-08-12 12:49:47 发布 · 373 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode

Online Judge 专栏收录该内容

134 篇文章

订阅专栏

本文介绍了一种使用二分搜索算法解决特定问题的方法。给定一个已排序的数组及目标值，若找到目标则返回其索引；若未找到，则返回目标值按顺序插入数组后的位置。文章通过具体示例展示了算法的应用。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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

» Solve this problem

二分搜索

class Solution {
public:
    int searchInsert(int A[], int n, int target) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        int left = 0, right = n - 1, mid = 0;
        while (left <= right) {
            mid = (left + right) >> 1;
            if (A[mid] == target) {
                return mid;
            }
            else if (A[mid] > target) {
                right = mid - 1;
            }
            else {
                left = mid + 1;
            }
        }
        if (A[mid] > target) {
            return mid;
        }
        else {
            return mid + 1;
        }
    }
};