Commit14d773b

committed

Update

1 parentc91672d commit14d773bCopy full SHA for 14d773b

File tree

-0

lines changed

-0

lines changed

Lines changed: 1 addition & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -149,6 +149,7 @@`
`149`	`149`	`*[回溯算法：排列问题（二）](https://mp.weixin.qq.com/s/9L8h3WqRP_h8LLWNT34YlA)`
`150`	`150`	`*[本周小结！（回溯算法系列三）](https://mp.weixin.qq.com/s/tLkt9PSo42X60w8i94ViiA)`
`151`	`151`
	`152`	`+`
`152`	`153`	`（持续更新中....）`
`153`	`154`
`154`	`155`	`#LeetCode 刷题攻略`

Lines changed: 3 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -56,10 +56,13 @@ candidates 中的每个数字在每个组合中只能使用一次。`
`56`	`56`
`57`	`57`	`回看一下题目，元素在同一个组合内是可以重复的，怎么重复都没事，但两个组合不能相同。`
`58`	`58`
	`59`	`+`
`59`	`60`	`所以我们要去重的是同一树层上的“使用过”，同一树枝上的都是一个组合里的元素，不用去重。`
`60`	`61`
`61`	`62`	`为了理解去重我们来举一个例子，candidates =[1, 1, 2], target = 3，（方便起见candidates已经排序了）`
`62`	`63`
	`64`	`+强调一下，树层去重的话，需要对数组排序！`
	`65`	`+`
`63`	`66`	`选择过程树形结构如图所示：`
`64`	`67`
`65`	`68`	`<imgsrc='../pics/40.组合总和II.png'width=600> </img></div>`

Comments

(0)