LeetCode 35. Search Insert Position
来源:互联网 发布:博罗网络问政主页 编辑:程序博客网 时间:2024/05/17 07:29
Description
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
Code
class Solution {public: int searchInsert(vector<int>& nums, int target) { for (int i = 0; i < nums.size(); i++) if (nums[i] >= target) return i; return nums.size(); }};
Appendix
- Link: https://leetcode.com/problems/search-insert-position/
- Run Time: 6ms
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
- 微信小程序navigator的open-type跳转问题
- 小记录
- 关于编程,一下学不成一个胖子(一个前端小学生的经验)
- [未解之谜]Email加载邮件详情慢
- 关于两个兼容inner与element
- LeetCode 35. Search Insert Position
- spring5
- Nginx反向代理
- Java编写进制转换器
- 复习1
- 设计模式之:单例模式
- consul
- MySQL语法系列之create数据库或表
- A. k-Factorization