Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commit 56bad73

Browse files
committed
Update binary_search.md
some notes
1 parent 18ed7bb commit 56bad73

File tree

1 file changed

+2
-2
lines changed

1 file changed

+2
-2
lines changed

‎basic_algorithm/binary_search.md‎

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -251,8 +251,8 @@ int findTarget(vector<int>& nums, int target, bool findLeft){
251251
思路有好几种:
252252
253253
1. 找到最小值,然后双指针
254-
2. 直接找k的子序列
255-
3. 删去最远的剩下的就是最近的k个子数组
254+
2. 直接找k成都的子序列
255+
3. 删去最远的剩下的就是最近的长度为k的子数组
256256
257257
258258
**Python版本**

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /