46. Permutations

最新推荐文章于 2021-02-09 10:20:41 发布

guyy_moon

最新推荐文章于 2021-02-09 10:20:41 发布

阅读量77

点赞数

分类专栏： Leetcode

本文链接：https://blog.csdn.net/faan0966/article/details/80391157

版权

Leetcode 专栏收录该内容

184 篇文章 0 订阅

订阅专栏

46. Permutations

class Solution {
public:
    /**
     * @param nums: A list of integers.
     * @return: A list of permutations.
     */
    vector<vector<int> > permute(vector<int>& nums) {
        // write your code here
        vector<vector<int>> res;
        vector<int> sub;
        vector<bool> visited(nums.size(), 0);
        if(nums.empty()){
            res.push_back(sub);//!!!!!!!!!
            return res;
        }
        helper(nums, visited, sub, res);
        return res;
    }
    
    void helper(vector<int>& nums, vector<bool> &visited, 
                vector<int> &sub, vector<vector<int>> &res){
        if(sub.size() == nums.size()){
            res.push_back(sub);
            return;
        }
        for(int i=0; i<nums.size(); i++){
            if(!visited[i]){
                sub.push_back(nums[i]);
                visited[i] = 1;
                helper(nums, visited, sub, res);
                sub.pop_back();
                visited[i] = 0;
            }
        }
    }
};