• Home
• com.github.javadev
• leetcode-in-kotlin
• 1.10
• source code
• readme.md

×

Project download

Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance.
Project price only 1 $

You can buy this project and download/modify it how often you want.

g0501_0600.s0560_subarray_sum_equals_k.readme.md Maven / Gradle / Ivy

560\. Subarray Sum Equals K

Medium

Given an array of integers `nums` and an integer `k`, return _the total number of subarrays whose sum equals to_ `k`.

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

**Example 1:**

**Input:** nums = [1,1,1], k = 2

**Output:** 2

**Example 2:**

**Input:** nums = [1,2,3], k = 3

**Output:** 2

**Constraints:**

*   1 <= nums.length <= 2 * 104
*   `-1000 <= nums[i] <= 1000`
*   -107 <= k <= 107