FilesExpand file tree

 master

/

LeetCode39.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

27 lines (23 loc) · 921 Bytes

 master

/

LeetCode39.java

Copy path

Top

File metadata and controls

• Code
• Blame

27 lines (23 loc) · 921 Bytes

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

package LeetCode.array;

import java.util.ArrayList;

import java.util.List;

public class LeetCode39 {

public List<List<Integer>> combinationSum(int[] candidates, int target) {

// Arrays.sort(candidates);

List<List<Integer>> result = new ArrayList<>();

recursive(candidates, new ArrayList<>(), target, result, 0);

return result;

}

private void recursive(int[] nums, List<Integer> list, int target, List<List<Integer>> result, int start){

if(target > 0){

for(int i = start; i < nums.length; i++){ //不对数组进行排序，这里的target >= nums[i]判断去除

list.add(nums[i]);

recursive(nums, list, target-nums[i], result,i);

list.remove(list.size()-1);

}

}

else if(target == 0){

result.add(new ArrayList<>(list));

}

}

}