【C++】【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

思路

这道题非常简单，只要遍历数组，如果当前数比目标大，则就插在这里，返回当前下标。如果小，就继续遍历。遍历结束，插在最后。

代码

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