摘要: 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 @ 2017-04-18 14:18 amazingzoe 阅读(133) 评论(0) 推荐(0) 编辑