Python---LeetCode/Solutions/0523_Continuous_Subarray_Sum.py at main · hpmsora/Python---LeetCode · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
class Solution:
    def checkSubarraySum(self, nums: List[int], k: int) -> bool:
        sum_reminder_dict = {}

        prev_sum = 0

        for index, num in enumerate(nums):
            prev_sum += num

            reminder = prev_sum % k
            if index >= 1 and reminder == 0:
                return True

            if reminder in sum_reminder_dict:
                pre_index = sum_reminder_dict[reminder]
                if index - pre_index > 1:
                    return True
                else:
                    continue

            sum_reminder_dict[reminder] = index
        return False