LeetCode 0035 - Search Insert Position
LeetCode 0035 - Search Insert Position
Reck Zhang
发布于 2021-08-11 10:23:13
发布于 2021-08-11 10:23:13
文章被收录于专栏：Reck Zhang
Search Insert Position
Desicription
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: 2Example 2:
Input: [1,3,5,6], 2
Output: 1Example 3:
Input: [1,3,5,6], 7
Output: 4Example 1:
Input: [1,3,5,6], 0
Output: 0Solution
class Solution {
public:
int searchInsert(vector<int>& nums, int target) {
return lower_bound(nums.begin(), nums.end(), target) - nums.begin();
}
};本文参与 腾讯云自媒体同步曝光计划，分享自作者个人站点/博客。
原始发表：2017-11-11，如有侵权请联系 cloudcommunity@tencent.com 删除
评论
登录后参与评论
推荐阅读
目录
腾讯云开发者
