minimum-size-subarray-sum

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

Algorithms

Given an array of positive integers <code>nums</code> and a positive integer <code>target</code>, return the minimal length of a subarray whose sum is greater than or equal to <code>target</code>. If there is no such subarray, return <code>0</code> instead.

&nbsp;
Example 1:

<pre>
Input: target = 7, nums = [2,3,1,2,4,3]
Output: 2
Explanation: The subarray [4,3] has the minimal length under the problem constraint.
</pre>

Example 2:

<pre>
Input: target = 4, nums = [1,4,4]
Output: 1
</pre>

Example 3:

<pre>
Input: target = 11, nums = [1,1,1,1,1,1,1,1]
Output: 0
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= target &lt;= 109</code></li>
	<li><code>1 &lt;= nums.length &lt;= 105</code></li>
	<li><code>1 &lt;= nums[i] &lt;= 104</code></li>
</ul>

&nbsp;
Follow up: If you have figured out the <code>O(n)</code> solution, try coding another solution of which the time complexity is <code>O(n log(n))</code>.