leetcode-35. Search Insert Position

原创于 2017-03-08 22:22:24 发布 · 185 阅读

0 ·

CC 4.0 BY-SA版权

leetcode 专栏收录该内容

24 篇文章

订阅专栏

本文解析了LeetCode上的第35题“Search Insert Position”，介绍了如何在已排序的数组中查找目标值的位置，若目标值不存在，则返回其应该插入的位置。提供了两种解决方案：一种是遍历数组的方法，另一种是对边界条件进行特殊处理的简洁实现。

leetcode-35. Search Insert Position

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

Subscribe to see which companies asked this question.

class Solution {
public:
    int searchInsert(vector<int>& nums, int target) {
        for(int i = 0; i < nums.size(); ++i){
            if(nums[i] >= target)
                return i;
        }
        return nums.size();
    }
};

class Solution {
public:
    int searchInsert(vector<int>& nums, int target) {
        int i = 0;
        if(target <= nums[0])
            return 0;
        if(target > nums[nums.size()-1]) //这里要注意！
            return nums.size();         //这里也要注意！
        else{
            while(target > nums[i])
                i++;
            return i;
        }
    }
};