Factor Combinations

Numbers can be regarded as product of its factors. For example,

8 = 2 x 2 x 2;
  = 2 x 4.

Write a function that takes an integer n and return all possible combinations of its factors.

Note: 

1. You may assume that n is always positive.
2. Factors should be greater than 1 and less than n.

Examples: 
input: 1
output: 

[]

input:  37
output: 

[]

input:  12
output:

[
  [2, 6],
  [2, 2, 3],
  [3, 4]
]

input:  32
output:

[
  [2, 16],
  [2, 2, 8],
  [2, 2, 2, 4],
  [2, 2, 2, 2, 2],
  [2, 4, 4],
  [4, 8]
]

实现的时候为了去重，需要在遍历的时候保证下一层可以用的因数不会比当前用的因数要小。

还有为了保证能够正确加载结果，对于10 = 2 * 5 这种不能够除尽情况，需要将5加入。

代码：

public List<List<Integer>> getFactors(int n) {
        List<List<Integer>> result = new ArrayList<>();
        for(int i=2;i<=Math.sqrt(n);i++){
            if(n%i == 0){
                List<Integer> cur = new ArrayList<>();
                cur.add(i);
                dfs(result, cur, n/i, i);
            }
        }
        return result;
    }

    private void dfs(List<List<Integer>> result, List<Integer> cur, int number, int startIndex){
        if(number == 1){
            result.add(new ArrayList<>(cur));
            //return;
        }
        for(int i=startIndex;i<=Math.sqrt(number);i++){
            if(number%i == 0){
                cur.add(i);
                dfs(result, cur, number/i, i);
                cur.remove(cur.size()-1);
            }
        }
        cur.add(number);
        result.add(new ArrayList<>(cur));
        cur.remove(cur.size()-1);

    }