FilesExpand file tree

 main

/

Contiguous_Array.py

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

18 lines (18 loc) · 410 Bytes

 main

/

Contiguous_Array.py

Copy path

Top

File metadata and controls

• Code
• Blame

18 lines (18 loc) · 410 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

class Solution:

def findMaxLength(self, nums: List[int]) -> int:

mx=0

d={0:-1}

cnt=0

l=0

for i in range(len(nums)):

if nums[i]==0:

cnt-=1

else:

cnt+=1

if cnt not in d:

d[cnt]=i

else:

l=i-d[cnt]

if l>mx:

mx=l

return mx