【c/c++】leetcode 35. Search Insert Position（easy）

版权声明：本文为博主原创文章，未经博主允许不得转载。 https://blog.csdn.net/maotianyi941005/article/details/84948738

35. Search Insert Position（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], 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

 由于比较简单 ，vector也有序，也就没考虑二分之类更快的搜索了，直接前向遍历，搜到相等或大于就返回该位置

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