Leetcode題解 C#：五月挑戰DAY26 Contiguous Array

public class Solution {
    public int FindMaxLength(int[] nums) {
        int result = 0;
        int counter0 = 0;
        var dp = new Dictionary();
        dp.Add(0,-1);
        for(int i = 0; i < nums.Length; i++)
        {
            counter0 += nums[i] == 0 ? 1 : -1;
            if(dp.ContainsKey(counter0))
                result = Math.Max(result, i - dp[counter0]);
            else
                dp[counter0] = i;            
        }
        return result;
    }
}