FazBrowse GitHub Viewer | Trending | | Home

Tools: [Download Repo ZIP] [View Raw Code] [Original HTTPS Page]

LeetCode-Solutions/Python/continuous-subarray-sum.py at master · Monika-R/LeetCode-Solutions · GitHub

24 lines (21 loc) · 523 Bytes

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

# Time: O(n)

# Space: O(k)

class Solution(object):

def checkSubarraySum(self, nums, k):

"""

:type nums: List[int]

:type k: int

:rtype: bool

"""

count = 0

lookup = {0: -1}

for i, num in enumerate(nums):

count += num

if k:

count %= k

if count in lookup:

if i - lookup[count] > 1:

return True

else:

lookup[count] = i

return False

Back | FazBrowse Home | New Git URL