2016年3月30日
[LeetCode] 325. Maximum Size Subarray Sum Equals k 最大子数组之和为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. Note:The sum of 阅读全文
posted @ 2016-03-30 12:14 Grandyang 阅读(21323) 评论(8) 推荐(0)
Fork me on GitHub