Участник:Dancho O/Continuous Subarray
Материал из DISCOPAL
https://leetcode.com/problems/continuous-subarray-sum
class Solution { public boolean checkSubarraySum(int[] nums, int k) { boolean flag = false; for (int i = 0; i < nums.length; i++) { int sum = nums[i]; for (int j = i + 1; j < nums.length; j++) { sum += nums[j]; if(k == 0 && sum == 0) { flag = true; } else { if(k != 0 && sum % k == 0) { flag = true; } } } } return flag; } }