LeetCode Search Insert Position
来源:互联网 发布:单片机plc 编辑:程序博客网 时间:2024/05/05 17:34
题目:
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 ans; ans = binarySearch(A, 0, n-1, target, n); return ans; }private: int binarySearch(int A[], int begin, int end, int target, int n) { while(begin <= end) { int mid = begin + (end - begin)/2; if(target == A[mid]) return mid; else if(target > A[mid]) { if(mid+1 < n && target < A[mid+1]) return mid+1; begin = mid + 1; } else { if(mid-1 >= 0 && target > A[mid-1]) return mid; end = mid -1; } } if(begin == n) return n; if(end == -1) return 0; }};
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
- node.js 第三方模块如何安装(使用npm)及介绍
- 杨辉三角形
- 对vector等STL标准容器进行排序操作
- MyEclipse6.5安装SVN插件的三种方法
- ios app开发的原则教程
- LeetCode Search Insert Position
- AndroidUI效果--开源项目IndexableListView(字母索引)
- 我觉得我越来越高深莫测了
- USACO/prefix
- As3 简单计算器的例子
- Win8.1下解决IE11浏览器不兼容的方法
- C语言部分库函数实现
- Webdings字体图案
- JDBC 连接MYSQL数据库