LeetCode：Permutations

最新推荐文章于 2019-01-13 06:57:25 发布

hackerzchao

最新推荐文章于 2019-01-13 06:57:25 发布

阅读量651

点赞数

分类专栏： LeetCode LeetCode 文章标签： leetcode 递归

本文链接：https://blog.csdn.net/hnuzengchao/article/details/42174707

版权

LeetCode 同时被 2 个专栏收录

48 篇文章 0 订阅

订阅专栏

LeetCode

48 篇文章 4 订阅

订阅专栏

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].

// Source : https://oj.leetcode.com/problems/permutations/
// Author : Chao Zeng
// Date   : 2014-12-26

class Solution {
public:
    vector<vector<int> > permute(vector<int> &num) {
        vector<vector<int> > tmp;
        dfs (tmp,num,0);
        return tmp;
    }

    void dfs(vector<vector<int> > &tmp, vector<int> &num, int cur){
        if (num.size() == cur){
            tmp.push_back(num);
        }
        else{
            for (int i = cur; i < num.size(); i++){
                swap(num[cur],num[i]);
                dfs(tmp,num,cur+1);
                swap(num[cur],num[i]);
            }
        }
    }
};