CS_learn/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2026-02-02 18:39:09 +08:00
Code Issues Packages Projects Releases Wiki Activity

更新图床

Browse Source
This commit is contained in:
programmercarl
2023-03-10 14:02:32 +08:00
parent 2a9b627a90
commit 17cb4b45c7
134 changed files with 1169 additions and 829 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
problems/0209.长度最小的子数组.md
View File

@@ -103,7 +103,7 @@ public:
解题的关键在于 窗口的起始位置如何移动，如图所示：
![leetcode_209](https://img-blog.csdnimg.cn/20210312160441942.png)
![leetcode_209](https://code-thinking-1253855093.file.myqcloud.com/pics/20210312160441942.png)
可以发现**滑动窗口的精妙之处在于根据当前子序列和大小的情况，不断调节子序列的起始位置。从而将O(n^2)暴力解法降为O(n)。**