leetcode+combinations DFS经典回溯

点击打开链接

///组合计算，DFS回溯
#include<iostream>
#include<stdio.h>
#include<stdlib.h>
#include<string>
#include<string.h>
#include<cstring>
#include<algorithm>
#include<math.h>
#include<vector>
using namespace std;
class Solution {
public:
    vector< vector<int> > res;
    vector<int> temp;
    void DFS(int n, int k, int t)
    {
        if(k==0){
            res.push_back(temp);
            //cout<<t<<","<<res.size()<<endl;
            // temp.clear();
            return;
        }
        int i=0;
        for(i=n;i>0;i--){
            temp.push_back(i);///插入
            DFS(i-1,k-1,t+1);
            temp.pop_back();///删除，模板解题
        }
    }
    vector< vector<int> > combine(int n, int k) {
        DFS(n,k,0);
        return res;
    }
};
int main()
{
    Solution temple;
    vector< vector<int> > re;
    re=temple.combine(4,2);
    for(int i=0;i<re.size();i++){
        for(int j=0;j<re[i].size();j++){
            cout<<re[i][j]<<" ";
        }
        cout<<endl;
    }
    return 0;
}