**Question:**\nhttps://leetcode.com/problems/subarray-sum-equals-k/\n\n---\n**Follow-up:**\nFind the maximum number of **non-overlapping** subarrays whose sum equals to `k`.\n\n**Example 1:**\n```\nInput: nums = [1, 1, 1], k = 2\nOutput: 1\n```\n\n**Example 2:**\n```\nInput: nums = [0, 0, 0, 0, 0], k = 0\nOutput: 5\n```

Question:\nhttps://leetcode.com/problems/subarray-sum-equals-k/\n\n---\nFollow-up:\nFind the maximum number of non-overlapping subarrays whose sum equals to k.\