本文主要是介绍35. 搜索插入位置，对大家解决编程问题具有一定的参考价值，需要的程序猿们随着小编来一起学习吧！

• 题目描述
• tips
• 代码

题目描述

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

tips

根据实例，观察得出违反循环条件时最终的情况，然后得出结论

代码

class Solution {
public:
    int searchInsert(vector<int>& nums, int target) {
        
        int n = nums.size();
        int l = 0;
        int r = n-1;
        while(l<=r)
        {
            int mid = l+(r-l)/2;
            if(nums[mid] == target)
                return mid;
            else if(nums[mid]>target)
                r=mid-1;
            else
                l=mid+1;
        }

        return l;
        
    }
};

这篇关于35. 搜索插入位置的文章就介绍到这儿，希望我们推荐的文章对大家有所帮助，也希望大家多多支持为之网！