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

Update 0239.滑动窗口最大值.md

Browse Source 
Change `O(n * log(n))` to `O(n log(n))`
This commit is contained in:
Lane Zhang (张健)
2024-10-22 11:00:13 +08:00
committed by GitHub
parent 97c4d1baec
commit 6e6093752f
1 changed files with 1 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@ -340,7 +340,7 @@ class Solution:
``` ```
#### 新解法：用"堆排序"实现 #### 新解法：用"堆排序"实现
* 时间复杂度：`O(n * log(n))`， 比`单调队列`解法要慢。 * 时间复杂度：`O(n log(n))`， 比`单调队列`解法要慢。
```python ```python
import heapq import heapq