39. 组合总和

void1024

于 2024-07-19 23:17:10 发布

阅读量109

点赞数 3

分类专栏：面试经典 150 题文章标签：算法数据结构 leetcode java

本文链接：https://blog.csdn.net/diOSyu/article/details/140561473

版权

面试经典 150 题专栏收录该内容

132 篇文章 1 订阅

订阅专栏

class Solution {
    List<List<Integer>> result;

    public List<List<Integer>> combinationSum(int[] candidates, int target) {
        result = new ArrayList<>(151);
        dfs(candidates, target, new ArrayList<>(), 0);
        return result;
    }

    private void dfs(int[] candidates, int target, List<Integer> path, int idx) {
        if (target < 0) {
            return;
        } else if (target == 0) {
            result.add(new ArrayList<>(path));
            return;
        }
        if(idx >= candidates.length) {
            return;
        }
        dfs(candidates, target, path, idx + 1);
        int cnt = 1;
        while (target >= candidates[idx]) {
            for (int i = 0; i < cnt; i++) {
                path.add(candidates[idx]);
            }
            target -= candidates[idx];
            dfs(candidates, target, path, idx + 1);
            for (int i = 0; i < cnt; i++) {
                path.remove(path.size() - 1);
            }
            cnt++;
        }
    }
}