摘要: 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-05-12 23:00 lettuan 阅读(169) 评论(0) 推荐(0) 编辑