[leetcode] 525. Contiguous Array

Given a binary array, find the maximum length of a contiguous subarray with equal number of 0 and 1.数组 Example 1: spa Input: [0,1] Output: 2 Explanation: [0, 1] is the longest contiguous subarray with
相关文章
相关标签/搜索