- 博客(1)
- 收藏
- 关注
RSS订阅原创 Leetcode: Maximum Size Subarray Sum Equals 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. Example 1: Given nums = [1, -1, 5, -2, 3], k = 3, return
2016-10-03 12:03:26
207
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人