-
Notifications
You must be signed in to change notification settings - Fork 0
/
LC_Continuous_Subarray_Sum.py
40 lines (38 loc) · 1.33 KB
/
LC_Continuous_Subarray_Sum.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
"""
523. Continuous Subarray Sum
Given a list of non-negative numbers and a target integer k, write a function to check if the array has a continuous subarray of size at least 2 that sums up to the multiple of k, that is, sums up to n*k where n is also an integer.
Example 1:
Input: [23, 2, 4, 6, 7], k=6
Output: True
Explanation: Because [2, 4] is a continuous subarray of size 2 and sums up to 6.
Example 2:
Input: [23, 2, 6, 4, 7], k=6
Output: True
Explanation: Because [23, 2, 6, 4, 7] is an continuous subarray of size 5 and sums up to 42.
Note:
The length of the array won't exceed 10,000.
You may assume the sum of all the numbers is in the range of a signed 32-bit integer.
"""
class Solution(object):
def checkSubarraySum(self, nums, k):
"""
:type nums: List[int]
:type k: int
:rtype: bool
"""
k = abs(k)
d_running = dict()
d_running[0] = -1
running_sum = 0
for index,num in enumerate(nums):
running_sum += num
if (k > 0):
running_sum %= k
if (running_sum in d_running):
if (index - d_running[running_sum] > 1):
return True
else:
d_running[running_sum] = index
return False
mysol = Solution()
print (mysol.checkSubarraySum( [23, 2, 6, 4, 7], 6))