525. 连续数组

class Solution:
    def findMaxLength(self, nums) -> int:
        oneCnt = 0
        d = {0: -1}
        res = 0
        for i, num in enumerate(nums):
            oneCnt += (num == 1)
            diff = 2*oneCnt-i-1  # 1 比 0 多的 个数
            if diff not in d:
                d[diff] = i
            else:
                res = max(res, i-d[diff])
        return res