LeetCode 325: Maximum Size Subarray Sum Equals k

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.
Hashmap is also used in this problem. Iterate the array and calculate the sum, if map[sum-k] in the hashmap, update the maxlength=max(maxlength, i-map[sum-k]).
Note that the map should be initialized as {0:-1} which promises the situation that the first n elements meet the requirement not ignored.

def solution(nums, k):
    if not nums or len(nums) == 0:
        return 0
    max_l, sum_ = 0, 0
    # start, end = 0, 0
    dic=  {0:-1}
    for i in range(len(nums)):
        sum_ += nums[i]
        if sum_-k in dic:
            max_l = max(max_l, i - dic[sum_-k])
            # if i - dic[sum_-k] > max_l:
            #     start, end = dic[sum_-k] + 1, i
        if sum_ not in dic:
            dic[sum_] = i
    return max_l