35. Search Insert Position

Posted 2022-02-23 forprometheus-jun

description:

给一个有序数列给一个target，找出在list中target对应的坐标，如果不在里边给出它应该在哪
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.
Note:

Example:

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

answer:

class Solution 
public:
    int searchInsert(vector<int>& nums, int target) 
        int pos = distance(nums.begin(), lower_bound(nums.begin(), nums.end(), target));
        return pos;
    
;

relative point get√：

hint :

参考34题，c++内置库真好使，真香