35. Search Insert Position

标签：inpu   index   return   else   arc   The   example   position   pre   

Problem:

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

思路：

Solution (C++):

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

性能：

Runtime: 4 ms??Memory Usage: 6.9 MB

思路：

Solution (C++):

性能：

Runtime: ms??Memory Usage: MB

35. Search Insert Position

标签：inpu   index   return   else   arc   The   example   position   pre   

原文地址：https://www.cnblogs.com/dysjtu1995/p/12584175.html