LeetCode 35. Search Insert Position

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

三、解题思路

• 顺序遍历数组，遇到target相等的，直接返回，遇到比target大的，break退出
• 当前遍历的index即时target要插入的位置

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