leetcode-algorithms-35 Search Insert Position

leetcode-algorithms-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.

Example 1:

Input: [1,3,5,6], 5
Output: 2

Example 2:

Input: [1,3,5,6], 2
Output: 1

Example 3:

Input: [1,3,5,6], 7
Output: 4

Example 4:

Input: [1,3,5,6], 0
Output: 0

解法

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

时间复杂度: O(n).

空间复杂度: O(1).

链接: leetcode-algorithms 目录