-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathContiguous_Array.py
More file actions
29 lines (25 loc) · 829 Bytes
/
Contiguous_Array.py
File metadata and controls
29 lines (25 loc) · 829 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
"""
Given a binary array, find the maximum length of a contiguous subarray with equal number of 0 and 1.
Example 1:
Input: [0,1]
Output: 2
Explanation: [0, 1] is the longest contiguous subarray with equal number of 0 and 1.
Example 2:
Input: [0,1,0]
Output: 2
Explanation: [0, 1] (or [1, 0]) is a longest contiguous subarray with equal number of 0 and 1.
Note: The length of the given binary array will not exceed 50,000.
"""
class Solution:
def findMaxLength(self, nums: List[int]) -> int:
count = 0
maxlen = 0
d = {0:-1}
for i in range(len(nums)):
count = (count + 1) if (nums[i]==1) else (count -1)
if count == 0:
maxlen = max(maxlen, i-d[count])
else:
d[count] = i
print(d, maxlen)
return maxlen