Given a specified total t and a list of integers, find all distinct sums using numbers from the list that add up to t. Use findSum(t, given_numbers, new LinkedList<Integer>())

gistfile1.java

public static LinkedList<LinkedList<Integer>> findSum(int t, LinkedList<Integer> input, LinkedList<Integer> used) {
        LinkedList<LinkedList<Integer>> inner, out = new LinkedList<LinkedList<Integer>>();
        
        Integer sum = 0, temp;
        LinkedList<Integer> usedBk, inputBk = (LinkedList<Integer>) input.clone();
        
        while ( !inputBk.isEmpty() ) {
            temp = inputBk.poll();
            
            if ( temp == sum ) {
                continue;
            }
            
            sum = temp;
            usedBk = new LinkedList<Integer>(used);
            usedBk.add(sum);

            if ( sum.intValue() == t ) {
                out.add(usedBk);

            } else if ( sum > t ) {
                continue;
            } else if ( sum < t ) {
                inner = findSum(t - sum, inputBk, usedBk);
                if ( inner != null ) {
                    out.addAll(inner);
                }
            }     
        }
        
        return out;
    }