[Swift]LeetCode325. 最大子数组之和为k $ Maximum Size Subarray Sum Equals k
Givenanarray nums andatargetvalue k,findthemaximumlengthofasubarraythatsumsto k.Ifthereisn'tone,return0instead.Example1:Given nums = [1,-1,5,-2,3], k = 3,return 4.(becausethesubarray [1,-1,5,-2] sumsto3andis