LeetCode--Search Insert Position
来源:互联网 发布:中国研究数据服务平台 编辑:程序博客网 时间:2024/06/03 20:29
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) { int low=0; int high = n-1; int mid; while(low<=high) { mid = (low+high)/2; if(A[mid] == target) return mid; else if(A[mid]>target) high = mid-1; else low = mid+1; } return low; }};
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
- nyoj-123 盗梦空间
- hdu 2289 Cup(二分)
- C++输入输出流
- Loadrunner测试小结
- 经典DP 多重部分和问题
- LeetCode--Search Insert Position
- iOS模拟器中导入视频,获取相册视频,视频缩略图
- STS设置utf-8
- Java多线程
- u-boot-2009.08在mini2440上的移植(四)---增加DM9000驱动和命令自动补全功能 ——调试心得
- android 编译学习
- C# GMarkerGoogle 报错,找不到
- LR--系统瓶颈分析
- linux命令后台运行