LeetCode || Permutations

最新推荐文章于 2020-04-25 12:34:34 发布

GeekFans

最新推荐文章于 2020-04-25 12:34:34 发布

阅读量635

点赞数

分类专栏： leetcode 文章标签： leetcode

本文链接：https://blog.csdn.net/jiadebin890724/article/details/23304619

版权

leetcode 专栏收录该内容

28 篇文章 0 订阅

订阅专栏

Permutations

Total Accepted: 11461 Total Submissions: 37405 My Submissions

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

思路：

递归，每次递归只确定一位的元素选择问题，用数组visited存储元素是否已被选择过，递归结束记得后把当前元素设置为未访问，即将visited值设为0.

class Solution {
public:
    vector<vector<int> > permute(vector<int> &num) {
        vector<vector<int> > res;

        if(num.size()){
            vector<int> visited(num.size(), 0);
            vector<int> cur(num.size());
            recur(res, num, visited, cur, num.size());
        }
        return res;
    }
    void recur(vector<vector<int> > &res, vector<int> &num, vector<int> &visited, vector<int> &cur, int n){
        if(n==0){
            res.push_back(cur);
            return;
        }
        int index=num.size()-n;
        for(int i=0; i<num.size(); ++i){
            if(!visited[i]){
                cur[index]=num[i];
                visited[i]=1;
                recur(res, num, visited, cur, n-1);
                visited[i]=0;
            }
        }
    }
};