classSolution{List<List<Integer>> res =newArrayList<>();List<Integer> path =newArrayList<>();publicList<List<Integer>>combinationSum3(int k,int n){backTracking(k, n,0,1);return res;}publicvoid backTracking (int k ,int n,int sum,int startIndex){if(sum > n)return;if(path.size()== k && sum == n){
res.add(newArrayList<>(path));return;}for(int i = startIndex; i <=9; i++){
path.add(i);backTracking(k, n , sum + i, i +1);
path.remove(path.size()-1);}}}