leetcode-35. Search Insert Position
来源:互联网 发布:公司网络有限制 编辑:程序博客网 时间:2024/05/16 10:12
leetcode-35. Search Insert Position
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 → 0Subscribe to see which companies asked this question.
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(); }};
class Solution {public: int searchInsert(vector<int>& nums, int target) { int i = 0; if(target <= nums[0]) return 0; if(target > nums[nums.size()-1]) //这里要注意! return nums.size(); //这里也要注意! else{ while(target > nums[i]) i++; return i; } }};
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
- Ubuntu 下 su:authentication failure的解决办法
- Android消息队列模型——Thread,Handler,Looper,Massage Queue
- word快速添加注释快捷键
- 【小练习】轮播图的封装
- iOS中强制app竖屏的解决办法
- leetcode-35. Search Insert Position
- USACO-Runaround Numbers(枚举)
- Nginx中的请求(nginx_http_request_t)
- 数组邻接表
- 订单可视化(智能制造、流程再造、企业信息化) 第七篇 经营班子掌舵,业务与开发分离,走向成功必备条件
- 代码编写过程中应该考虑的时序优化(笔记)
- Apache POI介绍
- 寻找递减最长路径
- 廖雪峰python教程阅读之python简介