Commit dfa8680

committed

add pic

1 parent 16134c6 commit dfa8680Copy full SHA for dfa8680

File tree

-0

lines changed

-0

lines changed

Lines changed: 2 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -96,6 +96,8 @@ class Solution(object):`
`96`	`96`	`>Output: 2`
`97`	`97`	`>解释:满足子数组和=7的最小长度数组是[4,3],所以output=2`
`98`	`98`	`- 解题思路:求的数字要大于等于这个数字target,譬如这个testcase中,[2,3,1,2,4,3],从前往后相加,前四项相加的和为8.已经大于7了,但是我们的target是7,后面的几项也都是正整数,继续往后走,肯定也会大于target7,所以这个时候我们把left指针往右移动一位,那么就是相当于成为了一个滑动窗口(sliding window),这种方法在String类型的题目出现的更多。`
	`99`	`+`
	`100`	`+![image](https://raw.githubusercontent.com/huxiaoman7/leetcodebook/master/Array/pic/subarray.png)`
`99`	`101`
`100`	`102`	`- code:`
`101`	`103`	`Java解法`

Comments

(0)