FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
LeetCode-Solutions/Python/maximum-average-subarray-i.py at master · tehsints/LeetCode-Solutions · GitHub
tehsints
/
LeetCode-Solutions
Public
forked from
kamyu104/LeetCode-Solutions
Notifications
You must be signed in to change notification settings
Fork
0
Star
0
Code
Pull requests
0
Actions
Projects
Security and quality
0
Insights
Additional navigation options
Code
Pull requests
Actions
Projects
Security and quality
Insights
Expand file tree
Breadcrumbs
LeetCode-Solutions
/
Python
/
maximum-average-subarray-i.py
Copy path
More file actions
More file actions
Latest commit
History
History
History
16 lines (14 loc) · 382 Bytes
Breadcrumbs
LeetCode-Solutions
/
Python
/
maximum-average-subarray-i.py
Copy path
File metadata and controls
16 lines (14 loc) · 382 Bytes
Raw
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
# Time: O(n)
# Space: O(1)
class
Solution
(
object
):
def
findMaxAverage
(
self
,
nums
,
k
):
"""
:type nums: List[int]
:type k: int
:rtype: float
"""
result
=
total
=
sum
(
nums
[:
k
])
for
i
in
xrange
(
k
,
len
(
nums
)):
total
+=
nums
[
i
]
-
nums
[
i
-
k
]
result
=
max
(
result
,
total
)
return
float
(
result
)
/
k
Back
|
FazBrowse Home
|
New Git URL