[leetcode] Search Insert Position
来源:互联网 发布:淘宝优惠券地址转换 编辑:程序博客网 时间:2024/05/18 02:36
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
思路:遍历,逐个查找
代码:
class Solution {public: int searchInsert(int A[], int n, int target) { if(n==0) return 0; int i; for(i=0;i<n;i++){ if(A[i]>=target) return i; } return i; }};
0 0
- LeetCode: Search Insert Position
- LeetCode Search Insert Position
- [Leetcode] Search Insert Position
- LeetCode : Search Insert Position
- [LeetCode] Search Insert Position
- [Leetcode] Search Insert Position
- [LeetCode]Search Insert Position
- [LeetCode] Search Insert Position
- LeetCode-Search Insert Position
- LeetCode - Search Insert Position
- LeetCode | Search Insert Position
- Leetcode: Search Insert Position
- 【LeetCode】Search Insert Position
- Leetcode Search Insert Position
- Leetcode: Search Insert Position
- LeetCode:Search Insert Position
- leetcode Search Insert Position
- LeetCode Search Insert Position
- Ubuntu下adb 显示insufficient permissions for device,或Eclipse中DDMS设备显示?????
- 如何实现可动态调整隐藏header的listview
- c# 命名空间、dll、与函数
- PHP redis操作类 个人总结
- Double 四舍五入保留小数
- [leetcode] Search Insert Position
- LeetCode OJ算法题(二十四):Reverse Nodes in k-Group
- MyEclipse下的javaweb项目,导入到eclipse j2ee版下问题于解决
- 郑州市最好的抑郁症医院
- ZOJ 3197 扫描 364页
- arm-linux系统开发笔记3:挂载USB
- Redis和Memcache的区别分析
- 网易有道笔试(2009)
- LeetCode OJ - Merge Sorted Array & Merge Two Sorted Lists