Commit 676bbc8

committed

update

1 parent 361277d commit 676bbc8Copy full SHA for 676bbc8

File tree

-1

lines changed

-1

lines changed

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -865,7 +865,7 @@ void quick_sort(int a[], int low, int high){`
`865`	`865`	```
`866`	`866`
`867`	`867`	`5. 堆排序:将待排序序列构造成一个大顶堆,此时,整个序列的最大值就是堆顶的根节点。将其与末尾元素进行交换,此时末尾就为最大值。然后将剩余n-1个元素重新构造成一个堆,这样会得到n个元素的次小值。如此反复执行,便能得到一个有序序列了。`
`868`		-```java
	`868`	+```
`869`	`869`	`public class Test {`
`870`	`870`
`871`	`871`	`public void sort(int[] arr) {`

Lines changed: 6 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -30,9 +30,15 @@ public void helper(int[] candidates, int target, int start, LinkedList<Integer>`
`30`	`30`	`if (!set.contains(candidates[i]) && target >= candidates[i]) {`
`31`	`31`	`stack.push(candidates[i]);`
`32`	`32`	`helper(candidates, target - candidates[i], i + 1, stack, res);`
	`33`	`+ System.out.println(stack + "before");`
`33`	`34`	`stack.pop();`
	`35`	`+ System.out.println(stack + "after");`
`34`	`36`	`set.add(candidates[i]);`
`35`	`37`	`}`
`36`	`38`	`}`
`37`	`39`	`}`
	`40`	`+`
	`41`	`+ public static void main(String[] args) {`
	`42`	`+ new Solution().combinationSum2(new int[]{10, 1, 2, 7, 6, 1, 5}, 8);`
	`43`	`+ }`
`38`	`44`	`}`

Comments

(0)