[LintCode] Minimum Size Subarray Sum 最小子数组和的大小

Posted Grandyang

tags:

篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了[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 -1 instead.

 
Example

Given the array [2,3,1,2,4,3] and s = 7, the subarray [4,3] has the minimal length under the problem constraint.

Challenge

If you have figured out the O(n) solution, try coding another solution of which the time complexity is O(n log n).

 

以上是关于[LintCode] Minimum Size Subarray Sum 最小子数组和的大小的主要内容,如果未能解决你的问题,请参考以下文章

lintcode160- Find Minimum in Rotated Sorted Array II- medium

Lintcode: Interval Minimum Number

[LintCode] Palindrome Partitioning II

lintcode-medium-Minimum Adjustment Cost

lintcode-medium-Minimum Window Substring

lintcode-easy-Minimum Path Sum