回溯算法-数的全排列

/**
 * @file permutatian.cpp
 * @author your name (you@domain.com)
 * @brief 
 * @version 0.1
 * @date 2022-06-27
 * 
 * @copyright Copyright (c) 2022
 * 输入一组数，返回这组数的全排列结果
 */

#include <iostream>
#include <vector>
#include <climits>
#include <algorithm>
using namespace std;

vector<vector<int>> res;

void backtrack(vector<int>& track,vector<int>& num)
{
    //结束条件
    if(track.size() == num.size())
    {
        vector<int> rs(num.size(),INT_MAX);
        rs.assign(track.begin(),track.end());
        res.push_back(rs);
        return;
    }
    //循环遍历
    for(int i = 0; i < num.size(); i++)
    {
        if(count(track.begin(),track.end(),num[i])) continue;
        //向路径选择列表添加
        track.push_back(num[i]);        
        //递归
        backtrack(track,num);
        //弹出
        track.pop_back();
    }
}
vector<vector<int>> compute(vector<int>& num)
{
    //路径
    vector<int> track;
    backtrack(track,num);
    return res;
}

int main()
{
    vector<int> num = {1,2,3,7};
    vector<vector<int>> results = compute(num);
    for(auto res : results)
    {
        cout << "[";
       for(auto re : res)
       {
           cout << re << ",";
       }
       cout << "]" << endl;
    }
    
}