算法入门 31.数字组合（回溯）

//不含重复数字的组合 回溯算法
vector<vector<int >>res;
vector<vector<int>combine(int n,int k){
    if(n<=0||k<=0) return res;
    vector<int >track;
    backtrack(n,k,1,track);
    return  res;
}
void backtrack(int n,int k,int start,vector<int>&track){
    if(k==track.size()){
        res.push_back(track);
        return res;
    }
    
    for(int i=start;i<=n;i++){
        track.push_back(i);
        backtrack(n,k,start+1,track);
        track.pop_back();
    }
}