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;
        }
    }
};