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 65406f8

Browse files
author
wuyudi
authored
Update README.md
1 parent f3271cc commit 65406f8

File tree

1 file changed

+8
-0
lines changed

1 file changed

+8
-0
lines changed

‎README.md‎

Lines changed: 8 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -2312,6 +2312,14 @@ class Solution:
23122312
return n <= sum((len(i) - 1) // 2 for i in s)
23132313
```
23142314
- 两边都加 0, 然后按 1 分割
2315+
## [643. 子数组最大平均数 I 2行](https://leetcode.com/problems/maximum-average-subarray-i/)
2316+
```python
2317+
class Solution:
2318+
def findMaxAverage(self, nums: List[int], k: int) -> float:
2319+
presum = [0, *accumulate(nums, add)]
2320+
return max(presum[i + 1] - presum[i + 1 - k] for i in range(k - 1, len(nums))) / float(k)
2321+
```
2322+
- 前缀和
23152323
## [652. Find Duplicate Subtrees 8行](https://leetcode.com/problems/find-duplicate-subtrees/)
23162324
```python
23172325
# Definition for a binary tree node.

0 commit comments

Comments
(0)

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