LeetCode,525. Contiguous Array

LeetCode

public class Solution {
    public int findMaxLength(int[] nums) {
        for (int i = 0; i < nums.length; i++) {
            if (nums[i] == 0) nums[i] = -1;
            }
        Map<Integer, Integer> map = new HashMap<>();
        map.put(0, -1);
        int sum = 0, max = 0;
        for(int i = 0; i<nums.length; i++){
            sum += nums[i];
            if(map.containsKey(sum)){
                max = Math.max(max,i - map.get(sum));
            }
            else{
                map.put(sum,i);
            }
        }
        return max;
    }
}