algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-09 19:44:45 +08:00
Code Issues Packages Projects Releases Wiki Activity

update 0239.滑动窗口最大值：添加复杂度分析

Browse Source
This commit is contained in:
Yuhao Ju
2023-04-01 12:55:37 +08:00
committed by GitHub
parent 6cd25d1fc5
commit 1662ac347d
1 changed files with 3 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

3
problems/0239.滑动窗口最大值.md
View File

@ -184,6 +184,9 @@ public:
} }
}; };
``` ```
* 时间复杂度: O(n)
* 空间复杂度: O(k)
再来看一下时间复杂度，使用单调队列的时间复杂度是 O(n)。 再来看一下时间复杂度，使用单调队列的时间复杂度是 O(n)。