LeetCode—35. Search Insert Position

Type：easy

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], 5Output:2

Example 2:

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

Example 3:

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

Example 4:

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

---

遍历该数组，若第i位大于或等于target，则target应该在第i位。若数组最后一位仍比target小，则for循环最后i++，仍返回i。

---

class Solution {

public:

    int searchInsert(vector& nums, int target) {

        int n = nums.size();

        int i;

        for(i=0; i

            if(nums[i] >= target) return i;

        }

        return i;

    }

};