diff --git a/algorithms/minimumSizeSubarraySum/MinimumSizeSubarraySum.cpp b/algorithms/minimumSizeSubarraySum/MinimumSizeSubarraySum.cpp index 7a8bd97..3fd5f8f 100644 --- a/algorithms/minimumSizeSubarraySum/MinimumSizeSubarraySum.cpp +++ b/algorithms/minimumSizeSubarraySum/MinimumSizeSubarraySum.cpp @@ -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.