LeetCode_Permute

最新推荐文章于 2021-12-23 13:06:47 发布

leileicaocao

最新推荐文章于 2021-12-23 13:06:47 发布

阅读量561

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/leileicaocao/article/details/9197163

版权

LeetCode 专栏收录该内容

31 篇文章 0 订阅

订阅专栏

Given a collection of numbers, return all possible permutations.

For example,
[1,2,3] have the following permutations:
[1,2,3], [1,3,2], [2,1,3], [2,3,1], [3,1,2], and [3,2,1].

void DFS(vector<vector<int> > &ans, vector<int> &vec, int n, int step)

{
    if (step == n)
    {
        ans.push_back(vec);
    }
    else
    {
        for (int i = step; i < n; ++i)
        {            
			swap(vec[step], vec[i]);
            DFS(ans, vec, n, step + 1);
            swap(vec[step], vec[i]);
        }
    }
}
vector<vector<int> > permute(vector<int> &num) 
{
    vector<vector<int> > ans;
    int size = num.size();
    DFS(ans, num, size, 0);
    return ans;
}