[LeetCode] questions conclusion_ Binary Search
Binary Search
T(n) = T(n/2) + O(1) => T(n) = O(lg n)
proof:
如果能用iterable , 就用while loop, 可以防止用recursion的时候stack overflow( process in Linux is 8Mb), stack room is static for each process. (堆空间, heap room 是内存, 是动态的。)层数越多,存储更多中间/临时变量,最终超过系统配的stack空间,就会出现stack overflow。
建议:
- 如果问题不复杂,能用iterable就用iterable
- 如果问题比较复杂,还是用recursive吧
1) ask 是否有duplicates?
1.1 如果没有duplicates
标准的binary search:
a) l + 1 < r 相当于如果l, r 相邻就跳出,这样能够避免死循环. 但是while loop之后需要加一个判断, 也就是d选项
b) l + (r - l)//2 # 不用(l+r)//2 , 因为l + r 有可能overflow,强行装*,当l + r 之和超过int的最大值,2的32次方减1,会溢出。
c) A[mid] ==, <, > # 为了bug free, 建议举个小栗子, 然后画图去判断.
d) A[l], A[r] ? target
Code
def BinarySearch(self, nums, target): # nums is sorted
if not nums or target < nums[0] or target > nums[-1]: return -1
l, r = 0, len(nums) -1 # note here is len(nums) -1
while l + 1 < r:
mid = l + (r - l)//2
if nums[mid] > target:
r = mid
elif nums[mid] < target:
l = mid
else:
return mid
if nums[l] == target:
return l
if nums[r] == target:
return r
return -1
1.2 如果有duplicates
a) ask 是first index, last index or dont matter?
如果是first index:
if A[mid] == target: r = mid
最后判断 A[l] 和A[r] 的时候先判断 A[l]
如果是last index:
if A[mid] == target: l = mid
最后判断 A[l] 和A[r] 的时候先判断 A[r]
Questions:
[LeetCode] 704. Binary Search_Easy tag: Binary Search
[LeetCode] 374. Guess Number Higher or Lower_Easy tag: Binary Search
[LeetCode] 34. Find First and Last Position of Element in Sorted Array == [LintCode] 61. Search for a Range_Easy tag: Binary Search first index and last index == target in duplicates.
[LeetCode] 35. Search Insert Position_Easy tag: Binary Search first index >= target, without duplicates
[LeetCode] 278. First Bad Version_Easy tag: Binary Search first index, without duplicates
[LeetCode] 162. Find Peak Element(852. Peak Index in a Mountain Array)_Medium tag: Binary Search
[LeetCode] 74. Search a 2D Matrix_Medium tag: Binary Search
[LeetCode] 240. Search a 2D Matrix II_Medium tag: Binary Search
[LeetCode] 69. Sqrt(x)_Easy tag: Binary Search
[LeetCode] 153. Find Minimum in Rotated Sorted Array_Medium tag: Binary Search first index <= nums[-1]
[LeetCode] 154. Find Minimum in Rotated Sorted Array II_Hard tag: not real binary search anymore
[LeetCode] 33. Search in Rotated Sorted Array_Medium tag: Binary Search
[LeetCode] 81. Search in Rotated Sorted Array II_Medium tag: not real binary search anymore
[LeetCode] 702. Search in a Sorted Array of Unknown Size_Medium tag: Binary Search
[LeetCode] 4. Median of Two Sorted Arrays_Hard tag: Array, Binary Search
[LeetCode] questions conclusion_ Binary Search的更多相关文章
- [LeetCode] 95. Unique Binary Search Trees II 唯一二叉搜索树 II
Given n, generate all structurally unique BST's (binary search trees) that store values 1...n. For e ...
- [LeetCode] 96. Unique Binary Search Trees 唯一二叉搜索树
Given n, how many structurally unique BST's (binary search trees) that store values 1...n? For examp ...
- [LeetCode] 272. Closest Binary Search Tree Value II 最近的二叉搜索树的值 II
Given a non-empty binary search tree and a target value, find k values in the BST that are closest t ...
- [leetcode]95. Unique Binary Search Trees II给定节点形成不同BST的集合
Given an integer n, generate all structurally unique BST's (binary search trees) that store values 1 ...
- [LeetCode] 95. Unique Binary Search Trees II(给定一个数字n,返回所有二叉搜索树) ☆☆☆
Unique Binary Search Trees II leetcode java [LeetCode]Unique Binary Search Trees II 异构二叉查找树II Unique ...
- Java for LeetCode 095 Unique Binary Search Trees II
Given n, generate all structurally unique BST's (binary search trees) that store values 1...n. For e ...
- [LeetCode] 98. Validate Binary Search Tree_Medium
Given a binary tree, determine if it is a valid binary search tree (BST). Assume a BST is defined as ...
- [LeetCode] 270. Closest Binary Search Tree Value 最近的二叉搜索树的值
Given a non-empty binary search tree and a target value, find the value in the BST that is closest t ...
- [LeetCode] Trim a Binary Search Tree 修剪一棵二叉搜索树
Given a binary search tree and the lowest and highest boundaries as L and R, trim the tree so that a ...
随机推荐
- 局域网里别人如何访问我本地电脑里的nginx网站
1.修改nginx.conf配置文件(我这里配了二级域名,所以我在二级域名配置文件修改) 把deny all全部改成autoindex on 2.关闭防火墙 3.重启nginx
- nodejs 获取自己的ip
代码片段 // npm i --save-dev request const request = require('request'); const url = "http://ip.tao ...
- UIScrollView _getDelegateZoomView bug 经历
[UIScrollView _getDelegateZoomView] UIKit -[UIScrollView_offsetForCenterOfPossibleZoomView:withIncom ...
- .NET Core开发日志——Peachpie
.NET Core的生态圈随着开源社区的力量不断注入至其中,正在变得越来越强盛,并且不时得就出现些有意思的项目,比如Peachpie,它使得PHP的代码迁移到.NET Core项目变得可能. 从创建简 ...
- C# chart 编程教程
http://www.gcpowertools.com.cn/docs/ComponentOne/WinFormChart/#!Documents/_41.htm
- 远程登录oracle 12.2数据库报错ORA-28040解决办法
今天新安装的oracle 12.2.0.1数据库,通过本地sqlplus远程登录12c数据库报错ora-28040,如下: ORA-28040: No matching authentication ...
- iOS调用第三方导航和线路规划
线路规划: https://blog.csdn.net/qq_19979539/article/details/51938995 百度地图:baidumap: 高德地图:iosamap: 腾讯地图:q ...
- MathType怎么打定积分竖线
MathType怎么打定积分竖线-MathType中文官网 http://www.mathtype.cn/jiqiao/dingjifen-shuxian.html 输入公式后在分隔符模板中选择左竖线 ...
- 在SVNX中实现$Ids的自动替换
在PHPstorm中实现$Ids的自动替换 ①.打开SVN的配置文件. [miscellany] enable-auto-props = yes [auto-props] .c = svn:keywo ...
- android&sqlsever
http://blog.csdn.net/chaoyu168/article/details/51910601