2016年8月26日
[LintCode] Minimum Size Subarray Sum 最小子数组和的大小
摘要： Given an array of n positive integers and a positive integer s, find the minimal length of a subarray of which the sum ≥ s. If there isn't one, return 阅读全文
posted @ 2016-08-26 14:07 Grandyang 阅读(959) 评论(0) 推荐(0) 编辑
Fork me on GitHub