Leetcode35. 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.

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 1:

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

---

非常简单的一道数组中搜索的题目，不多说了。

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