Leetcode 560. Subarray Sum Equals K

来源：互联网发布：深入浅出java 编辑：程序博客网时间：2024/06/05 01:59

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 = 2Output: 2

用一个hash map来储存（子数组之和，出现次数）

public class Solution {    public int subarraySum(int[] nums, int k) {        int sum = 0;        int result = 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)) {                result += map.get(sum - k);            }            map.put(sum, map.getOrDefault(sum,0) + 1);        }        return result;    }}

0 0

Leetcode 560. Subarray Sum Equals K
[leetcode] 560. Subarray Sum Equals K
leetcode题解-560. Subarray Sum Equals K
Leetcode 560. Subarray Sum Equals K
LeetCode OJ-560.Subarray Sum Equals K
560. Subarray Sum Equals K leetcode
[leetcode]560. Subarray Sum Equals K
[LeetCode] 560. Subarray Sum Equals K
leetcode 560. Subarray Sum Equals K
LeetCode 560. Subarray Sum Equals K
[LeetCode] 560. Subarray Sum Equals K
Leetcode 560. Subarray Sum Equals K
LeetCode：M-560. Subarray Sum Equals K
【Leetcode】560. Subarray Sum Equals K
LeetCode-560. Subarray Sum Equals K
leetcode 523. Continuous Subarray Sum 560. Subarray Sum Equals K
[LeetCode]Subarray Sum Equals K
leetCode-Subarray Sum Equals K
设计模式六大原则
Eclipse的Servers视图中无法添加Tomcat6/Tomcat7
mongo 不同字段比较，根据比较结果进行修改
css选择器
【4月在校总结】
Leetcode 560. Subarray Sum Equals K
mongodb[五]如何实现分页查询
Unity3D与iOS交互的两种方式
解决cookie跨域访问
git 的简单命令
微软编程题之在二元树中找出和为某一值的所有路径
C# JS操作类
Fiddler抓取数据并分析（完整的配置教程）
别让这样的废话毁了简历，马上删掉！