2015年5月13日
[LeetCode] 209. Minimum Size Subarray Sum 最短子数组之和
摘要： Given an array of n positive integers and a positive integer s, find the minimal length of a contiguous subarray of which the sum ≥ s. If there isn't 阅读全文
posted @ 2015-05-13 22:37 Grandyang 阅读(30333) 评论(18) 推荐(0) 编辑
Fork me on GitHub