guanjihuan/GitHub_collection_leetcode
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

adjust the comment length

Browse Source
This commit is contained in:
Hao Chen 2015-06-09 23:42:35 +08:00
parent 5251bee7b1
commit 3eea06551a
1 changed files with 2 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

3
algorithms/minimumSizeSubarraySum/MinimumSizeSubarraySum.cpp
View File

@ -4,7 +4,8 @@
/**********************************************************************************
*
* 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 0 instead.
* 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 0 instead.
*
* For 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.