#LeetCode# 35. Search Insert Position

标签：++   example   targe   div   amp   out   ble   arc   target   

https://leetcode.com/problems/search-insert-position/description/

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

代码：

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

#LeetCode# 35. Search Insert Position

标签：++   example   targe   div   amp   out   ble   arc   target   

原文地址：https://www.cnblogs.com/zlrrrr/p/9908537.html