[Leetcode] 523. Continuous Subarray Sum

最新推荐文章于 2025-02-16 11:05:14 发布

原创最新推荐文章于 2025-02-16 11:05:14 发布 · 173 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

LeetCode 同时被 2 个专栏收录

70 篇文章

订阅专栏

#DP

1 篇文章

订阅专栏

本文详细解析了LeetCode上的连续子数组和问题，提供了两种解决方案：一是使用额外的sum数组来存储累积和，二是直接在原数组上进行滑动窗口计算。每种方法都附有详细的代码实现，展示了如何检查是否存在子数组其和能被特定整数k整除。

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(n²)
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(n²)
SC: O(1)