Leetcode 560 Subarray Sum Equals K

最新推荐文章于 2024-01-11 20:27:09 发布

Nahida_nora

最新推荐文章于 2024-01-11 20:27:09 发布

阅读量136

点赞数

分类专栏： Leetcode

本文链接：https://blog.csdn.net/weixin_43876597/article/details/105283678

版权

Leetcode 专栏收录该内容

98 篇文章 0 订阅

订阅专栏

Leetcode 560 Subarray Sum Equals K

Using Cummulative sum
sum[i] is used to store the cumulative sum of numsnums array upto the element corresponding to the (i-1)th.
th
index.

	for (int i = 1; i <= nums.length; i++)
            sum[i] = sum[i - 1] + nums[i - 1];
        for (int start = 0; start < nums.length; start++) {
            for (int end = start + 1; end <= nums.length; end++) {
                if (sum[end] - sum[start] == k)
                    count++;
            }
        }

Without space

	for (int start = 0; start < nums.length; start++) {
            int sum=0;
            for (int end = start; end < nums.length; end++) {
                sum+=nums[end];
                if (sum == k)
                    count++;
            }
        }

Using hashmap

		HashMap < Integer, Integer > map = new HashMap < > ();
        map.put(0, 1);
        for (int i = 0; i < nums.length; i++) {
            sum += nums[i];
            if (map.containsKey(sum - k))
                count += map.get(sum - k);
            map.put(sum, map.getOrDefault(sum, 0) + 1);
        }