Given a binary array, find the maximum length of a contiguous subarray with equal number of 0 and 1. code example

Example: largest subarray of 0's and 1's

public class Solution {

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