Subarray Sum
文章平均质量分 58
再见小小ronnie
这个作者很懒,什么都没留下…
展开
-
Subarray Sum Closest
Step 1. Calculate the prefix sum for each position in the array. Step 2. Sort the prefix sum array. Step 3. Compare every prefix sum and distance between two adjacent prefix sum, choose the minimum原创 2017-03-08 03:34:59 · 188 阅读 · 0 评论 -
Sub Array Sum to 0
Using a hashmap to save the sum and index pair, initialize the map to sum the integers in the array, if we meet a sum that exits in the map, means we found a subarray that sums to 0, return the beg原创 2017-03-07 12:44:56 · 280 阅读 · 0 评论