contiguous-array

java

python3

python

javascript

typescript

csharp

golang

kotlin

swift

rust

ruby

dart

scala

elixir

erlang

racket

cangjie

bash

mysql

mssql

postgresql

oraclesql

pythondata

Algorithms

Given a binary array <code>nums</code>, return the maximum length of a contiguous subarray with an equal number of <code>0</code> and <code>1</code>.

&nbsp;
Example 1:

<pre>
Input: nums = [0,1]
Output: 2
Explanation: [0, 1] is the longest contiguous subarray with an equal number of 0 and 1.
</pre>

Example 2:

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

Example 3:

<pre>
Input: nums = [0,1,1,1,1,1,0,0,0]
Output: 6
Explanation: [1,1,1,0,0,0] is the longest contiguous subarray with equal number of 0 and 1.
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= nums.length &lt;= 105</code></li>
	<li><code>nums[i]</code> is either <code>0</code> or <code>1</code>.</li>
</ul>

findMaxLength

Contiguous Array

Maximum Size Subarray Sum Equals k

maximum-size-subarray-sum-equals-k

和等于 k 的最长子数组长度

Find All Possible Stable Binary Arrays I

find-all-possible-stable-binary-arrays-i

找出所有稳定的二进制数组 I

Find All Possible Stable Binary Arrays II

find-all-possible-stable-binary-arrays-ii

找出所有稳定的二进制数组 II

Array

Hash Table

Prefix Sum

&#32473;&#23450;&#19968;&#20010;&#20108;&#36827;&#21046;&#25968;&#32452; <code>nums</code> , &#25214;&#21040;&#21547;&#26377;&#30456;&#21516;&#25968;&#37327;&#30340; <code>0</code> &#21644; <code>1</code> &#30340;&#26368;&#38271;&#36830;&#32493;&#23376;&#25968;&#32452;&#65292;&#24182;&#36820;&#22238;&#35813;&#23376;&#25968;&#32452;&#30340;&#38271;&#24230;&#12290;

&nbsp;

&#31034;&#20363; 1&#65306;

<pre>
&#36755;&#20837;&#65306;nums = [0,1]
&#36755;&#20986;&#65306;2
&#35828;&#26126;&#65306;[0, 1] &#26159;&#20855;&#26377;&#30456;&#21516;&#25968;&#37327; 0 &#21644; 1 &#30340;&#26368;&#38271;&#36830;&#32493;&#23376;&#25968;&#32452;&#12290;</pre>

&#31034;&#20363; 2&#65306;

<pre>
&#36755;&#20837;&#65306;nums = [0,1,0]
&#36755;&#20986;&#65306;2
&#35828;&#26126;&#65306;[0, 1] (&#25110; [1, 0]) &#26159;&#20855;&#26377;&#30456;&#21516;&#25968;&#37327; 0 &#21644; 1 &#30340;&#26368;&#38271;&#36830;&#32493;&#23376;&#25968;&#32452;&#12290;</pre>

&#31034;&#20363; 3&#65306;

<pre>
&#36755;&#20837;&#65306;nums = [0,1,1,1,1,1,0,0,0]
&#36755;&#20986;&#65306;6
&#35299;&#37322;&#65306;[1,1,1,0,0,0] &#26159;&#20855;&#26377;&#30456;&#21516;&#25968;&#37327; 0 &#21644; 1 &#30340;&#26368;&#38271;&#36830;&#32493;&#23376;&#25968;&#32452;&#12290;</pre>

&nbsp;

&#25552;&#31034;&#65306;

<ul>
	<li><code>1 &lt;= nums.length &lt;= 105</code></li>
	<li><code>nums[i]</code> &#19981;&#26159; <code>0</code> &#23601;&#26159; <code>1</code></li>
</ul>

Sunbelt Computer Software

PL/B Language Development and Support