FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
LeetCode-Solutions/Python/contiguous-array.py at master · pythonpeixun/LeetCode-Solutions · GitHub
pythonpeixun
/
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
/
contiguous-array.py
Copy path
More file actions
More file actions
Latest commit
History
History
History
20 lines (17 loc) · 462 Bytes
Breadcrumbs
LeetCode-Solutions
/
Python
/
contiguous-array.py
Copy path
File metadata and controls
20 lines (17 loc) · 462 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
16
17
18
19
# Time: O(n)
# Space: O(n)
class
Solution
(
object
):
def
findMaxLength
(
self
,
nums
):
"""
:type nums: List[int]
:rtype: int
"""
result
,
count
=
0
,
0
lookup
=
{
0
:
-
1
}
for
i
,
num
in
enumerate
(
nums
):
count
+=
1
if
num
==
1
else
-
1
if
count
in
lookup
:
result
=
max
(
result
,
i
-
lookup
[
count
])
else
:
lookup
[
count
]
=
i
return
result
Back
|
FazBrowse Home
|
New Git URL