77. Combinations
发布时间:2020-12-14 03:20:47 所属栏目:大数据 来源:网络整理
导读:class Solution { public ListListInteger combine( int n, int k) { List ListInteger result = new ArrayList (); List Integer current = new ArrayList (); dfs(n,k,result,current, 0,1 ); return result; } private void dfs( int n, int k,ListListIn
class Solution { public List<List<Integer>> combine(int n,int k) { List<List<Integer>> result = new ArrayList<>(); List<Integer> current = new ArrayList<>(); dfs(n,k,result,current,0,1); return result; } private void dfs(int n,int k,List<List<Integer>> result,List<Integer> current,int index,int start){ if(index == k){ result.add(new ArrayList<Integer>(current)); return; } for(int i = start; i <= n; i++){ current.add(i); dfs(n,index + 1,i + 1); current.remove(current.size() - 1); } } } (编辑:李大同) 【声明】本站内容均来自网络,其相关言论仅代表作者个人观点,不代表本站立场。若无意侵犯到您的权利,请及时与联系站长删除相关内容! |