subarray-sum-equals-k

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 an array of integers <code>nums</code> and an integer <code>k</code>, return the total number of subarrays whose sum equals to <code>k</code>.

A subarray is a contiguous non-empty sequence of elements within an array.

&nbsp;
Example 1:
<pre>Input: nums = [1,1,1], k = 2
Output: 2
</pre>Example 2:
<pre>Input: nums = [1,2,3], k = 3
Output: 2
</pre>
&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= nums.length &lt;= 2 * 104</code></li>
	<li><code>-1000 &lt;= nums[i] &lt;= 1000</code></li>
	<li><code>-107 &lt;= k &lt;= 107</code></li>
</ul>

subarraySum

Subarray Sum Equals K

Two Sum

two-sum

两数之和

Continuous Subarray Sum

continuous-subarray-sum

连续的子数组和

Subarray Product Less Than K

subarray-product-less-than-k

乘积小于 K 的子数组

Find Pivot Index

find-pivot-index

寻找数组的中心下标

Subarray Sums Divisible by K

subarray-sums-divisible-by-k

和可被 K 整除的子数组

Minimum Operations to Reduce X to Zero

minimum-operations-to-reduce-x-to-zero

将 x 减到 0 的最小操作数

K Radius Subarray Averages

k-radius-subarray-averages

半径为 k 的子数组平均值

Maximum Sum Score of Array

maximum-sum-score-of-array

数组的最大总分

Array

Hash Table

Prefix Sum

给你一个整数数组 <code>nums</code> 和一个整数&nbsp;<code>k</code> ，请你统计并返回 该数组中和为&nbsp;<code>k</code>&nbsp;的子数组的个数&nbsp;。

子数组是数组中元素的连续非空序列。

&nbsp;

示例 1：

<pre>
输入：nums = [1,1,1], k = 2
输出：2
</pre>

示例 2：

<pre>
输入：nums = [1,2,3], k = 3
输出：2
</pre>

&nbsp;

提示：

<ul>
	<li><code>1 &lt;= nums.length &lt;= 2 * 104</code></li>
	<li><code>-1000 &lt;= nums[i] &lt;= 1000</code></li>
	<li><code>-107 &lt;= k &lt;= 107</code></li>
</ul>