题目来源

• leetcode：254-VIP. 因子的组合

题目描述

class Solution {
    
public:
    vector<vector<int>> getFactors(int n){
    
        
    }
};

题目解析

题意

给定一个正整数n,Write the form of multiplying all factors,It also specifies that the factors are arranged in order from small to large

思路

• Because of the need to list all the cases,So it can be solved by backtracking
• As stated in the title1和ncannot be counted as a factor by itself,那么可以从2开始遍历到n,如果当前的数i可以被n整除,说明i是n的一个因子,Store it in a one-bit array out 中,然后递归调用 n/i,not at this time2开始遍历,而是从i遍历到 n/i
• The stop condition is whenn等于1时,如果此时 out 中有因子,Store this combination in the result res 中

class Solution {
    
public:
    vector<vector<int>> getFactors(int n) {
    
        vector<vector<int>> res;
        helper(n, 2, {
    }, res);
        return res;
    }
    void helper(int n, int start, vector<int> out, vector<vector<int>>& res) {
    
        if (n == 1) {
    
            if (out.size() > 1) res.push_back(out);
            return;
        }
        for (int i = start; i <= n; ++i) {
    
            if (n % i != 0) continue;
            out.push_back(i);
            helper(n / i, i, out, res);
            out.pop_back();
        }
    }
};

优化

class Solution {
    
public:
    vector<vector<int>> getFactors(int n) {
    
        vector<vector<int>> res;
        helper(n, 2, {
    }, res);
        return res;
    }
    void helper(int n, int start, vector<int> out, vector<vector<int>> &res) {
    
        for (int i = start; i <= sqrt(n); ++i) {
    
            if (n % i != 0) continue;
            vector<int> new_out = out;
            new_out.push_back(i);
            helper(n / i, i, new_out, res);
            new_out.push_back(n / i);
            res.push_back(new_out);
        }
    }
};