LeetCode 题解(253) : 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. 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]
]

题解：

Backtracing。要保证新加入的元素大于等于之前的元素。Python递归会超时。大部分时间应该都花在了重复求模运算上。

C++版：

class Solution {
public:
    vector<vector<int>> getFactors(int n) {
        vector<vector<int>> results;
        vector<int> result;
        getFactorsRecur(n, results, result, 0);
        return results;
    }
    
    void getFactorsRecur(int n, vector<vector<int>> &results, vector<int> result, int last) {
        for(int i = 2; i < n; i++) {
            if(n / i >= i && i >= last && n % i == 0) {
                result.push_back(i);
                result.push_back(n / i);
                results.push_back(result);
                result.pop_back();
                getFactorsRecur(n / i, results, result, i);
                result.pop_back();
            }
        }
    }
};