Minimum Size Subarray Sum; Two Pointer;

转载于 2016-02-23 04:58:00 发布 · 121 阅读

0 ·

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/5683yue/p/5208671.html

本文介绍了一种使用两指针法寻找满足条件的最短子数组的方法。首先找到从首个元素开始的最短子数组，其和大于等于目标值。随后移动头部指针来寻找可能的更短子数组，直至尾部指针到达数组末尾。

Use two pointer to find the minimum subarray size;

At first, we find the shortest subarray from the first element of which the sum is greater than or equal to target. We set tailIdx to be the index of the last element of that subarray.

Then move the headIdx to find the possible shortest subarray which the last element is in the tailIdx position. Now we move the headIdx and tailIdx concurrently by adding one to get the next subarray which has the sum is greater than or equal to target. Then we go to the step 1.

After the step 1 and in the procedure of step 2 the tailIdx get to end of the array, return the count. Or we get to an element of which the value is greater than or equal to the target, return 1.

转载于:https://www.cnblogs.com/5683yue/p/5208671.html