FilesExpand file tree

 master

/

maximum-size-subarray-sum-equals-k.py

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

21 lines (20 loc) · 591 Bytes

 master

/

maximum-size-subarray-sum-equals-k.py

Copy path

Top

File metadata and controls

• Code
• Blame

21 lines (20 loc) · 591 Bytes

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

# Time: O(n)

# Space: O(n)

class Solution(object):

def maxSubArrayLen(self, nums, k):

"""

:type nums: List[int]

:type k: int

:rtype: int

"""

sums = {}

cur_sum, max_len = 0, 0

for i in xrange(len(nums)):

cur_sum += nums[i]

if cur_sum == k:

max_len = i + 1

elif cur_sum - k in sums:

max_len = max(max_len, i - sums[cur_sum - k])

if cur_sum not in sums:

sums[cur_sum] = i # Only keep the smallest index.

return max_len