[Lintcode] Minimum size Subarray Sum minimum sub-arrays and sizes

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.

Has you met this question in a real interview? Example

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

Challenge

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

[Lintcode] Minimum size Subarray Sum minimum sub-arrays and sizes