Lintcode 911. Maximum Size Subarray Sum Equals k (Medium) (Python)

Maximum Size Subarray Sum Equals k

Description:

Given an array nums and a target value k, find the maximum length of a subarray that sums to k. If there isn’t one, return 0 instead.

Example
Given nums = [1, -1, 5, -2, 3], k = 3, return 4.

Explanation:
because the subarray [1, -1, 5, -2] sums to 3 and is the longest.
Given nums = [-2, -1, 2, 1], k = 1, return 2.

Explanation:
because the subarray [-1, 2] sums to 1 and is the longest.
Challenge
Can you do it in O(n) time?

Notice
The sum of the entire nums array is guaranteed to fit within the 32-bit signed integer range.

Code:

class Solution:
    """
    @param nums: an array
    @param k: a target value
    @return: the maximum length of a subarray that sums to k
    """
    def maxSubArrayLen(self, nums, k):
        # Write your code here
        ln = len(nums)
        dic = {0:-1}
        sum = 0
        res = 0
        for i in range(ln):
            sum+=nums[i]
            dic[sum] = i if sum not in dic else dic[sum]
            if sum-k in dic:
                res = max(res, i-dic[sum-k])
        print(dic)
        return res