The Solution to Leetcode 35 Search Insert Position

Question:

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.

给定排序的数组和目标值，如果找到找到目标，返回索引。如果没有，按顺序插入索引就返回索引。

思路：哈哈哈，还是排序好的了的数组，开心！这个题目把给的例子按顺序捋一遍就可以写出代码了，我这么菜鸟级的，这道题五分钟搞定，简直开心！

Answer:

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

run code results:

Your input

[1,3,5,6]
5

Your answer

2

Expected answer

2