mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-11 02:58:13 +08:00
19 lines
672 B
HTML
19 lines
672 B
HTML
|
<p>Given an array of integers <code>nums</code> and an integer <code>k</code>, return <em>the total number of subarrays whose sum equals to <code>k</code></em>.</p>
|
||
|
|
|
||
|
|
<p> </p>
|
||
|
|
<p><strong>Example 1:</strong></p>
|
||
|
|
<pre><strong>Input:</strong> nums = [1,1,1], k = 2
|
||
|
|
<strong>Output:</strong> 2
|
||
|
|
</pre><p><strong>Example 2:</strong></p>
|
||
|
|
<pre><strong>Input:</strong> nums = [1,2,3], k = 3
|
||
|
|
<strong>Output:</strong> 2
|
||
|
|
</pre>
|
||
|
|
<p> </p>
|
||
|
|
<p><strong>Constraints:</strong></p>
|
||
|
|
|
||
|
|
<ul>
|
||
|
|
<li><code>1 <= nums.length <= 2 * 10<sup>4</sup></code></li>
|
||
|
|
<li><code>-1000 <= nums[i] <= 1000</code></li>
|
||
|
|
<li><code>-10<sup>7</sup> <= k <= 10<sup>7</sup></code></li>
|
||
|
|
</ul>
|