class Solution { private List ls; private int n; private LinkedList path; private int k; private int[] arr = new int[] { 1, 2, 3, 4, 5, 6, 7, 8, 9 }; public List> combinationSum3(int k, int n) { path = new LinkedList(); ls = new LinkedList(); this.n = n; this.k = k; dfs(0, 0, 0); return ls; } pri...