LeetCode--560--medium--SubarraySumEqualsK

summary:

hash table | math

package myapp.kit.leetcode.top100liked;

import java.util.HashMap;
import java.util.Map;

/**
 *
 *560
 * medium
 * https://leetcode.com/problems/subarray-sum-equals-k/
 *
 *
 *
 * Given an array of integers and an integer k, you need to find the total number of continuous subarrays whose sum equals to k.
 *
 * Example 1:
 *
 * Input:nums = [1,1,1], k = 2
 * Output: 2
 *
 *[-92,-63,75,-86,-58,22,31,-16,-66,-67,420]
 * 100
 *
 * Constraints:
 *
 * The length of the array is in range [1, 20,000].
 * The range of numbers in the array is [-1000, 1000] and the range of the integer k is [-1e7, 1e7].
 *
 * @author huangdingsheng
 * @version 1.0, 2020/6/2
 */
public class SubarraySumEqualsK {

    // hash table
    public int subarraySum(int[] nums, int k) {

        if (nums == null || nums.length == 0) {
            return 0;
        }
        int answer = 0;
        int sum = 0;
        Map<Integer, Integer> map = new HashMap<>();
        map.put(0, 1);
        for (int i = 0; i < nums.length; i++) {
            sum += nums[i];
            if (map.containsKey(sum - k)) {
                answer += map.get(sum - k);
            }
            if (map.containsKey(sum)) {
                map.put(sum, map.get(sum) + 1);
            } else {
                map.put(sum, 1);
            }
        }
        return answer;
    }

}