@@ -0,0 +1,930 @@
+public class Solution %7B%0A    /*%0A     * @param A: an integer array%0A     * @param k: a postive integer %3C= length(A)%0A     * @param target: an integer%0A     * @return: A list of lists of integer%0A     */%0A    List%3CList%3CInteger%3E %3E ans;%0A    public void dfs(int A%5B%5D, int K, int target, int index, List%3CInteger%3E tans)%0A    %7B%0A%0A        if(K == 0 && target == 0) %7B%0A            ans.add(new ArrayList%3CInteger%3E(tans));%0A            return ;%0A        %7D%0A        if(K %3C 0 %7C%7C target %3C 0 %7C%7C index %3C 0)%0A            return ;%0A        dfs(A, K, target, index - 1, tans);%0A        tans.add(A%5Bindex%5D);%0A        dfs(A, K  - 1, target - A%5Bindex%5D, index - 1, tans);%0A        tans.remove(tans.size() - 1);%0A        %0A    %7D%0A    %0A    public List%3CList%3CInteger%3E%3E kSumII(int A%5B%5D, int K, int target) %7B%0A        ans = new ArrayList%3CList%3CInteger%3E%3E();%0A        List%3CInteger%3E tans = new ArrayList%3CInteger%3E();%0A        dfs(A, K, target, A.length - 1, tans);%0A        return ans;%0A    %7D%0A%7D

add 90