LeetCode(13), Contiguous Array

Description

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

Example 1:

Input: [0,1]
Output: 2
Explanation: [0, 1] is the longest contiguous subarray with equal number of 0 and 1.

Example 2:

Input: [0,1,0]
Output: 2
Explanation: [0, 1] (or [1, 0]) is a longest contiguous subarray with equal number of 0 and 1.

Note: The length of the given binary array will not exceed 50,000.

Solution

给一个变量sum, 如果数组中元素是0，sum减去1，如果数组中元素是1， sum加上1。
如果sum等于0，则表明子数组中0和1的个数相同。为了记住上一次sum等于0时数组的index，采用HashMap。

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