Problems: https://leetcode.com/problems/continuous-subarray-sum/
Solution1:
利用sum存储到第 i 位的sum
注意计算diff时subarray长度至少为2
class Solution {
public boolean checkSubarraySum(int[] nums, int k) {
int[] sum = new int[nums.length];
sum[0] = nums[0];
for (int i=1;i<sum.length; i++) {
sum[i] = sum[i-1] + nums[i];
}
for (int i=0;i<sum.length-1; i++) {
for (int j=i+1;j<sum.length; j++) {
int diff = sum[j] - sum[i] + nums[i]; // 长度为2
if(k == 0 && diff == 0) {
return true;
} else if(k != 0 && diff % k == 0) {
return true;
}
}
}
return false;
}
}
TC: O(n2)
SC: O(n)
Solution2:
class Solution {
public boolean checkSubarraySum(int[] nums, int k) {
for (int i = 0; i < nums.length-1;i++) {
int sum = nums[i];
for (int j = i+1; j < nums.length; j++) {
sum += nums[j];
if(k == 0 && sum == 0) {
return true;
} else if(k != 0 && sum % k == 0) {
return true;
}
}
}
return false;
}
}
TC: O(n2)
SC: O(1)