binary-subarrays-with-sum

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

Given a binary array <code>nums</code> and an integer <code>goal</code>, return the number of non-empty subarrays with a sum <code>goal</code>.

A subarray is a contiguous part of the array.

&nbsp;
Example 1:

<pre>
Input: nums = [1,0,1,0,1], goal = 2
Output: 4
Explanation: The 4 subarrays are bolded and underlined below:
[1,0,1,0,1]
[1,0,1,0,1]
[1,0,1,0,1]
[1,0,1,0,1]
</pre>

Example 2:

<pre>
Input: nums = [0,0,0,0,0], goal = 0
Output: 15
</pre>

&nbsp;
Constraints:

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

numSubarraysWithSum

Binary Subarrays With Sum

Count Subarrays With Score Less Than K

count-subarrays-with-score-less-than-k

统计得分小于 K 的子数组数目

Ways to Split Array Into Good Subarrays

ways-to-split-array-into-good-subarrays

将数组划分成若干好子数组的方式

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

Sliding Window

给你一个二元数组 <code>nums</code> ，和一个整数 <code>goal</code> ，请你统计并返回有多少个和为 <code>goal</code> 的 非空 子数组。

子数组 是数组的一段连续部分。

 

示例 1：

<pre>
输入：nums = [1,0,1,0,1], goal = 2
输出：4
解释：
有 4 个满足题目要求的子数组：[1,0,1]、[1,0,1,0]、[0,1,0,1]、[1,0,1]
</pre>

示例 2：

<pre>
输入：nums = [0,0,0,0,0], goal = 0
输出：15
</pre>

 

提示：

<ul>
	<li><code>1 <= nums.length <= 3 * 104</code></li>
	<li><code>nums[i]</code> 不是 <code>0</code> 就是 <code>1</code></li>
	<li><code>0 <= goal <= nums.length</code></li>
</ul>