class Solution{
public:
vector<vector<int> > dfs(int n,int l){
vector<vector<int> > res;
for(int i=l;i*i<=n;i++){
if(n%i==0){
res.push_back({i,n/i});
for(auto v : dfs(n/i,i)){
v.push_back(i);
res.push_back(v);
}
}
}
return res;
}
vector<vector<int> > getFactors(int n){
return dfs(n,2);
}
};
254 因子的组合
最新推荐文章于 2022-09-11 23:55:20 发布