天河最新代码owopqk

最新推荐文章于 2021-08-06 04:22:58 发布

qq_38512857

最新推荐文章于 2021-08-06 04:22:58 发布

阅读量93

点赞数

本文链接：https://blog.csdn.net/qq_38512857/article/details/108551145

版权

class Solution {    private List<List<Integer>> ans = new ArrayList<>();    public List<List<Integer>> combine(int n, int k) {        getCombine(n, k, 1, new ArrayList<>());        return ans;    }        public void getCombine(int n, int k, int start, List<Integer> list) {        if(k == 0) {            ans.add(new ArrayList<>(list));            return;        }        for(int i = start;i <= n - k + 1;i++) {            list.add(i);            getCombine(n, k - 1, i+1, list);            list.remove(list.size() - 1);        }    }

class Solution {    private List<List<Integer>> ans = new ArrayList<>();    public List<List<Integer>> combine(int n, int k) {        getCombine(n, k, 1, new ArrayList<>());        return ans;    }        public void getCombine(int n, int k, int start, List<Integer> list) {        if(k == 0) {            ans.add(new ArrayList<>(list));            return;        }        for(int i = start;i <= n - k + 1;i++) {            list.add(i);            getCombine(n, k - 1, i+1, list);            list.remove(list.size() - 1);        }    }

class Solution {    private List<List<Integer>> ans = new ArrayList<>();    public List<List<Integer>> combine(int n, int k) {        getCombine(n, k, 1, new ArrayList<>());        return ans;    }        public void getCombine(int n, int k, int start, List<Integer> list) {        if(k == 0) {            ans.add(new ArrayList<>(list));            return;        }        for(int i = start;i <= n - k + 1;i++) {            list.add(i);            getCombine(n, k - 1, i+1, list);            list.remove(list.size() - 1);        }    }

class Solution {    private List<List<Integer>> ans = new ArrayList<>();    public List<List<Integer>> combine(int n, int k) {        getCombine(n, k, 1, new ArrayList<>());        return ans;    }        public void getCombine(int n, int k, int start, List<Integer> list) {        if(k == 0) {            ans.add(new ArrayList<>(list));            return;        }        for(int i = start;i <= n - k + 1;i++) {            list.add(i);            getCombine(n, k - 1, i+1, list);            list.remove(list.size() - 1);        }    }

class Solution {    private List<List<Integer>> ans = new ArrayList<>();    public List<List<Integer>> combine(int n, int k) {        getCombine(n, k, 1, new ArrayList<>());        return ans;    }        public void getCombine(int n, int k, int start, List<Integer> list) {        if(k == 0) {            ans.add(new ArrayList<>(list));            return;        }        for(int i = start;i <= n - k + 1;i++) {            list.add(i);            getCombine(n, k - 1, i+1, list);            list.remove(list.size() - 1);        }    }

class Solution {    private List<List<Integer>> ans = new ArrayList<>();    public List<List<Integer>> combine(int n, int k) {        getCombine(n, k, 1, new ArrayList<>());        return ans;    }        public void getCombine(int n, int k, int start, List<Integer> list) {        if(k == 0) {            ans.add(new ArrayList<>(list));            return;        }        for(int i = start;i <= n - k + 1;i++) {            list.add(i);            getCombine(n, k - 1, i+1, list);            list.remove(list.size() - 1);        }    }