[leetcode 35]Search Insert Position

最新推荐文章于 2025-06-05 14:05:55 发布

清空的代码

最新推荐文章于 2025-06-05 14:05:55 发布

阅读量296

点赞数

分类专栏： leetcode 文章标签： leetcode c++

本文链接：https://blog.youkuaiyun.com/Xiaohei00000/article/details/50823363

版权

leetcode 专栏收录该内容

119 篇文章

订阅专栏

Question:

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

分析：

已知给定数组是有序的，这样依次比较即可，很简单。

代码如下：

<span style="font-size:14px;">class Solution {
public:
    int searchInsert(vector<int>& nums, int target) {
        if(nums.size() < 0)
            return 0;
        for(int i = 0; i < nums.size(); ++i){
            if(target == nums[i])
                return i;
            else{
                if(target > nums[i]){
                    if(i == nums.size()-1)
                        return i+1;
                    else
                        continue;
                }
                    
                else{
                    if(i == 0)
                        return 0;
                    else
                        return i;
                }
            }
        }
    }
};</span>