number-of-centered-subarrays

java

python3

python

javascript

typescript

csharp

golang

kotlin

swift

rust

ruby

dart

scala

elixir

erlang

racket

bash

mysql

mssql

postgresql

oraclesql

pythondata

Algorithms

You are given an integer array <code>nums</code>.

A subarray of <code>nums</code> is called centered if the sum of its elements is equal to at least one element within that same subarray.

Return the number of centered subarrays of <code>nums</code>.

&nbsp;
Example 1:

<div class="example-block">
Input: nums = [-1,1,0]

Output: 5

Explanation:

<ul>
	<li>All single-element subarrays (<code>[-1]</code>, <code>[1]</code>, <code>[0]</code>) are centered.</li>
	<li>The subarray <code>[1, 0]</code> has a sum of 1, which is present in the subarray.</li>
	<li>The subarray <code>[-1, 1, 0]</code> has a sum of 0, which is present in the subarray.</li>
	<li>Thus, the answer is 5.</li>
</ul>
</div>

Example 2:

<div class="example-block">
Input: nums = [2,-3]

Output: 2

Explanation:

Only single-element subarrays (<code>[2]</code>, <code>[-3]</code>) are centered.
</div>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= nums.length &lt;= 500</code></li>
	<li><code>-105 &lt;= nums[i] &lt;= 105</code></li>
</ul>