Movatterモバイル変換


[0]ホーム

URL:


Skip to content
DEV Community
Log in Create account

DEV Community

Karleb
Karleb

Posted on

#523. Continuous Subarray Sum

https://leetcode.com/problems/continuous-subarray-sum/description/?envType=daily-question&envId=2024-06-11

js/** * @param {number[]} nums * @param {number} k * @return {boolean} */var checkSubarraySum = function(nums, k) {    let sum = 0    const remainderMap = new Map()    remainderMap.set(0, -1)    for(let i = 0; i < nums.length; i++) {        sum += nums[i]        let remainder = sum % k        remainder = remainder < 0 ? remainder + k : remainder        if (remainderMap.has(remainder)) {            if (i - remainderMap.get(remainder) > 1) return true        } else {            remainderMap.set(remainder, i)        }    }    return false};
Enter fullscreen modeExit fullscreen mode

Top comments(0)

Subscribe
pic
Create template

Templates let you quickly answer FAQs or store snippets for re-use.

Dismiss

Are you sure you want to hide this comment? It will become hidden in your post, but will still be visible via the comment'spermalink.

For further actions, you may consider blocking this person and/orreporting abuse

I love to make things work.
  • Joined

More fromKarleb

DEV Community

We're a place where coders share, stay up-to-date and grow their careers.

Log in Create account

[8]ページ先頭

©2009-2025 Movatter.jp