Factor Combination | LeetCode

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. Each combination's factors must be sorted ascending, for example: The factors of 2 and 6 is [2, 6], not [6, 2]. 
2. You may assume that n is always positive. 
3. 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]
]

思路：

一个dfs,最开始想的太简单了，直接来了一个历史最慢解法。。假设当前factor为i的话，其实我们要循环到n/i就可以了。最开始我写了一个循环到n为止，发现太慢了。然后写到n/2,再后来发现循环到n/i 比较好。另外，如果不是考虑溢出的话，能用*就别用/

代码如下：

class Solution {
public:
    vector<vector<int>> getFactors(int n) {
        vector<vector<int>> result;
        vector<int> solu;
        if (n <=1)
            return result;
        dfs(result,solu,n,n,2);
        return result;
    }
private:
    void dfs(vector<vector<int>> &result,vector<int> &solu,int num,int n,int idx) {
        if (num == 1) {
            result.push_back(solu);
            return;
        }
        for (int i = idx; i*idx <= n; i++) {
            if (num%i == 0) {
                solu.push_back(i);
                dfs(result,solu,num/i,n,i);
                solu.pop_back();
            }
        }
    }
};