Commit 6bc51d3

authored

Update 436._Find_Right_Interval.md

1 parent 21cf2c5 commit 6bc51d3Copy full SHA for 6bc51d3

File tree

-1

lines changed

-1

lines changed

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -80,7 +80,7 @@ class Solution(object):`
`80`	`80`	`后面我想到既然所有的start都不一样,我不如搞一个list存排过序的start,然后这样就可以用二分查找来找到第一个大于某end的idx了,`
`81`	`81`	`同样的用一个字典来存start和idx的信息。`
`82`	`82`
`83`		`-这个二分的思想就是找到第一个大于target的index,思路跟第35题一样`
	`83`	`+这个二分的思想就是找到第一个大于target的index,思路跟[leetcode第35题](https://github.com/apachecn/awesome-leetcode/blob/master/docs/Leetcode_Solutions/035._search_insert_position.md)一样`
`84`	`84`
`85`	`85`	```python
`86`	`86`	`class Solution(object):`

Comments

(0)