523. Continuous Subarray Sum
纪录prefix sum的余数
若之前出现过相同余数的prefix sum
代表这之间的subarray可以被k整除
不过实作起来细节也不少
像是要init mod_hit[0] = -1之类的
WA了几次
渍渍渍
def checkSubarraySum(self, nums: List[int], k: int) -> bool:
mod_hit = {}
mod_hit[0] = -1
sum_cur = 0
for idx,i in enumerate(nums):
sum_cur += i
if (sum_cur%k) in mod_hit and (idx-mod_hit[sum_cur%k])>=2:
return True
elif (sum_cur%k) not in mod_hit:
mod_hit[sum_cur%k] = idx
return False