LeetCode OJ-560.Subarray Sum Equals K
来源:互联网 发布:易达打印软件 编辑:程序博客网 时间:2024/06/05 09:42
LeetCode OJ-560.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 = 2Output: 2
Note:
- 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].
题目理解
给定一个k,在数组中求和为k的连续子数组有多少个。因为是连续的,可以两层循环直接遍历就行了。要注意一个点,遍历时当加到某个元素时,和刚好为k,这时候++cnt就好了,还应该继续遍历下去,直至到达数组尾部。
Code
class Solution {public: int subarraySum(vector<int>& nums, int k) { int cnt = 0; int sz = (int) nums.size(); int i, j; int sum; for (i = 0; i < sz; ++i) { sum = nums[i]; if (sum == k) { ++cnt; } for (j = i + 1; j < sz; ++j) { sum += nums[j]; if (sum == k) { ++cnt; } } } return cnt; }};
0 0
- LeetCode OJ-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
- 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
- 欢迎使用CSDN-markdown编辑器
- 20170506@java中三种长度表现形式
- Arrays中的方法asList()返回来的list与new ArrayList()区别
- android arcgis入门(八)、Json与Geometry的相互转换
- 关于spring mvc的单例问题
- LeetCode OJ-560.Subarray Sum Equals K
- 1069. 微博转发抽奖
- Json解析包 阿里巴巴 FastJson 的使用
- selenium安装和chromedriver配置
- mongo3.4权限控制
- WAMPServer自定义网站根目录
- logging库的使用
- Leetcode 566(Java)
- Android中TextView开头空两格的问题