[leetcode] 35.Search Insert Position
来源:互联网 发布:男士护肤品推荐 知乎 编辑:程序博客网 时间:2024/06/09 17:11
题目:
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.
Here are few examples.
[1,3,5,6], 5 → 2
[1,3,5,6], 2 → 1
[1,3,5,6], 7 → 4
[1,3,5,6], 0 → 0
题意:
给定一个有序数组,给定一个指定值,如果这个元素在数组中,找出其下标,如果不在,找到该插入的位置。
思路:
使用STL的lower_bound
代码如下:
class Solution {public: int searchInsert(vector<int>& nums, int target) { if(nums.size() == 0)return 0; auto iter = lower_bound(nums.begin(), nums.end(), target); return (iter - nums.begin()); }};
0 0
- [LeetCode]35.Search Insert Position
- LeetCode --- 35. Search Insert Position
- LeetCode 35.Search Insert Position
- [Leetcode] 35. Search Insert Position
- LeetCode 35. Search Insert Position
- [leetcode] 35.Search Insert Position
- Leetcode 35. Search Insert Position
- 35. Search Insert Position LeetCode
- [LeetCode]35. Search Insert Position
- LeetCode 35. Search Insert Position
- 【LeetCode】35. Search Insert Position
- leetcode 35. Search Insert Position
- leetcode 35. Search Insert Position
- LeetCode 35. Search Insert Position
- LeetCode *** 35. Search Insert Position
- leetcode 35. Search Insert Position
- [LeetCode]35. Search Insert Position
- LeetCode 35. Search Insert Position
- python 获取linux环境变量
- 以后在CSDN落个户,开始写自己的科研笔记。
- tortoisesvn 版本控制文件图标解读
- Maven实战 -- 目录
- 进程退出
- [leetcode] 35.Search Insert Position
- Android listview里面包含checkbox
- [c]poj1007
- redis综合mark
- Atlassian JIRA 插件开发(三)——常见问题
- 领域特定语言 martin fowler著 学习笔记1
- GitHub使用详解
- Android Studio安装Genymotion插件
- 在linux和windows上安装qt及creator