17 lines
509 B
C++
17 lines
509 B
C++
#include <vector>
|
|
#include <algorithm>
|
|
|
|
/**
|
|
* 35. Search Insert Position
|
|
*
|
|
* Given a sorted array of distinct integers 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 must write an algorithm with O(log n) runtime complexity.
|
|
*/
|
|
|
|
class Solution {
|
|
public:
|
|
static inline int searchInsert(const std::vector<int>& nums, int target) {
|
|
return std::lower_bound(nums.begin(), nums.end(), target) - nums.begin();
|
|
}
|
|
};
|