35. Search Insert Position（LeetCode）

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

class Solution {
public:
    int searchInsert(vector<int>& nums, int target) {
            int  local = -1;
        vector<int>::iterator ite;
        ite=find(nums.begin(), nums.end(), target);
        if (ite == nums.end())
        {
            nums.push_back(target);
            sort(nums.begin(), nums.end());
            for (int i = 0; i < nums.size(); i++)
            {
                if (nums[i] == target)
                    local = i;
            }
        }
        else
        {
            for (int i = 0; i < nums.size(); i++)
            {
                if (nums[i] == target)
                    local = i;
            }
        }
        return local;
    }
};

别人的代码，很聪明

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