[leetcode] 523. Continuous Subarray Sum

[leetcode] 523. Continuous Subarray Sum

Description

Given a list of non-negative numbers and a target integer k, write a function to check if the array has a continuous subarray of size at least 2 that sums up to the multiple of k, that is, sums up to n*k where n is also an integer.

Example 1:

Input: [23, 2, 4, 6, 7], k=6Output: TrueExplanation: Because [2, 4] is a continuous subarray of size 2 and sums up to 6.

Example 2:

Input: [23, 2, 6, 4, 7], k=6Output: TrueExplanation: Because [23, 2, 6, 4, 7] is an continuous subarray of size 5 and sums up to 42.

Note:

The length of the array won’t exceed 10,000.You may assume the sum of all the numbers is in the range of a signed 32-bit integer.

分析

题目的意思是：给你一个数组，找出一个子数组，使得子数组之和能被n整除

思路也比较直接，把所有的子数组都列举出来然后判断是否符合条件就行了，这里需要用到两个循环，第一个循环表示子数组的开始位置，第二个循环表示子数组的结束位置。

代码

class Solution {public: bool checkSubarraySum(vector& nums, int k) { int sum=0; for(int i=0;i

参考文献

​​[LeetCode] Continuous Subarray Sum 连续的子数组之和​​

版权声明：本文内容由网络用户投稿，版权归原作者所有，本站不拥有其著作权，亦不承担相应法律责任。如果您发现本站中有涉嫌抄袭或描述失实的内容，请联系我们jiasou666@gmail.com 处理，核实后本网站将在24小时内删除侵权内容。