Leet|

Categories:

Tags:

题目描述
思路分析
参考代码

题目描述

🔥 560. 和为 K 的子数组

思路分析

前缀和+哈希表

参考代码

func subarraySum(nums []int, k int) int {
	hashtable := make(map[int]int)
	hashtable[0] = 1
	res, total := 0, 0
	for _, num := range nums {
		total += num
		if count, ok := hashtable[total-k]; ok {
			res += count
		}
		hashtable[total]++
	}
	return res
}

🍏 点击查看 Java 题解

class Solution {
    public int subarraySum(int[] nums, int k) {
        Map<Integer, Integer> map = new HashMap<>();
        map.put(0, 1);
        int total = 0;
        int res = 0;
        for (int num : nums) {
            total += num;
            res += map.getOrDefault(total - k, 0);
            map.put(total, map.getOrDefault(total, 0) + 1);
        }
        return res;
    }
}

本文作者: HGNULB

本文链接: https://hgnulb.github.io/blog/2022/13096231