Solution (leetcode-in-java 1.15 API)

java.lang.Object
- g0501_0600.s0560_subarray_sum_equals_k.Solution

```
public class Solution
extends Object
```
560 - Subarray Sum Equals K\. Medium Given an array of integers `nums` and an integer `k`, return _the total number of continuous subarrays whose sum equals to `k`_. **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 * 10⁴ * `-1000 <= nums[i] <= 1000` * -10⁷ <= k <= 10⁷

- Constructor Summary
  
  Constructors
  Constructor Description
  
  Solution()
- Method Summary
  
  All Methods Instance Methods Concrete Methods
  Modifier and Type Method Description
  
  int subarraySum(int[] nums, int k)
  - Methods inherited from class java.lang.Object
    clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail
- Solution
```
public Solution()
```

Method Detail

subarraySum

public int subarraySum(int[] nums,
                       int k)