class Solution:def findMaxLength(self, nums: List[int]) -> int:map= {0:-1}n = len(nums)count = 0max_len = 0for i in range(n):if nums[i] == 0:count += -1else:count += 1if count in map:max_len = max(max_len,i-map[count])else:map[count] = i return max_len