[LeetCode]035-Search Insert Position
来源:互联网 发布:js修改url参数 不刷新 编辑:程序博客网 时间:2024/06/01 07:40
题目:
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
Solution:
思路,改进的二分查找,有意思的是当这个数不在数列里时,在二分查找的终止返回条件里(left > right),return left,即是它插入的位置。
在纸上画一画就能得出结论。
int searchInsert(vector<int>& nums, int target) { int n = nums.size(); int left = 0; int right = n-1; return Binary_Search(nums,left,right,target); } int Binary_Search(vector<int>& nums,int left,int right,int target) { if(left <= right) { int mid = (left+right)/2; if(nums[mid] == target) return mid; else if(nums[mid] < target) Binary_Search(nums,mid+1,right,target); else Binary_Search(nums,left,mid-1,target); } else return left; }
0 0
- LeetCode 035 Search Insert Position
- leetcode 035 Search Insert Position
- LeetCode 035 Search Insert Position
- [LeetCode]035-Search Insert Position
- LeetCode 035 Search Insert Position
- leetcode 035 Search Insert Position
- leetcode 035 Search Insert Position
- LeetCode 035 Search Insert Position
- LeetCode 035: Search Insert Position
- LeetCode 035 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
- poj 2565 Average is not Fast Enough! 水题
- 【leetcode题解】【回溯】【54】【M】Subsets II
- [test]图片
- hdoj1212Big Number(大数)
- 汇编总结
- [LeetCode]035-Search Insert Position
- myeclipse/eclipse修改默认的java代码风格
- Intellij IDEA安装golang插件
- cuda中矩阵相加编程
- java开发中文乱码总结
- hdoj1234开门人和关门人(结构体+sort)
- 设计模式——观察者模式
- TextureView与Camera
- Java高级部分容器---equals方法和hashcode方法解密