[leetcode]560. Subarray Sum Equals K
来源:互联网 发布:淘宝基础版装修规格 编辑:程序博客网 时间:2024/06/05 19:04
题目链接:https://leetcode.com/problems/subarray-sum-equals-k/#/description
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
思路:
用sum表示从数组开始位置到当前位置的数字相加和,我们还可以用Hash Table来存储sum出现的次数,如果当前位置之前有相加和为sum-k的位置,则这两个位置之间的数字相加和为k,以当前位置结尾的相加和为k的子数组个数为hash[sum-k],这样遍历整个数组即可得出满足条件的子数组个数。
class Solution{public: int subarraySum(vector<int>& nums,int k) { int sum=0,cnt=0; unordered_map<int,int> hash; hash[0]=1; for(int i=0;i<nums.size();i++) { sum+=nums[i]; cnt+=hash[sum-k]; hash[sum]++; } return cnt; }};
阅读全文
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
- Entity Framework Core 创建表一对一,表之间外键【约束】
- ATM交易状态特征分析与异常检测(深圳杯B题)
- hdoj1021 Fibonacci Again
- java api 查询hbase
- Codeforces161D【树形DP】
- [leetcode]560. Subarray Sum Equals K
- 模的应用--uva11582 Colossal Fibonacci Numbers!
- 如何在ubuntu下 安装谷歌
- Ajax学习
- cublasGemmEx函数应用-探究8bit矩阵乘
- 深度学习入门必须理解这25个概念
- 河南省第十届ACM省赛题目:问题 D: 年终奖金
- Java高并发基础概念
- 业务报警与检测