LeetCode 525. Contiguous Array

525. Contiguous Array

Decsription

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

• 题意即寻找0-1数组中最长的一个子串长度，该子串满足0和1数量相等。
• 我们可以将0换成-1，那么题意就变成寻找最长和为0的子串。
• 具体做法如下，附注释。

class Solution {
public:
    int findMaxLength(vector<int>& nums) {
        map<int,int> s;
        s[0] = -1; //避免满足条件子串即原数组的情况
        int sum = 0; // 记录当前位置和
        int rnt = 0;
        for (int i = 0;i < nums.size();i++) {
            if (nums[i] == 0) nums[i] = -1;
            sum += nums[i];
            if (s.count(sum)) {  // 如果在之前出现过和sum相同的和，那么就说明那个位置到当前位置之前的子串满足条件
                rnt = max(rnt,i - s[sum]);
            }
            else {
                s[sum] = i; 
            }
        }
        return rnt;
    }
};