LeetCode 46: Permutations

最新推荐文章于 2021-02-04 14:52:57 发布

claviclelau

最新推荐文章于 2021-02-04 14:52:57 发布

阅读量436

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/claviclelau/article/details/11173599

版权

LeetCode 专栏收录该内容

56 篇文章 0 订阅

订阅专栏

Difficulty: 3

Frequency: 4

Problem:

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

Solution:

class Solution {
public:
    vector<vector<int> > permute(vector<int> &num) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        vector<vector<int> > answer;
        if (num.size()==0)
            return answer;
        permuteUniqueRecursive(num, answer, 0);
    }
    void permuteUniqueRecursive(vector<int> & num, vector<vector<int> > & answer, int n)
    {
        if (n == num.size()-1)
        {
            answer.push_back(num);
            return;
        }
        
        for (int i = n; i<num.size(); i++)
        {
                
            int i_temp = num[n];
            num[n] = num[i];
            num[i] = i_temp;
            
            permuteUniqueRecursive(num, answer, n+1);
            
            i_temp = num[n];
            num[n] = num[i];
            num[i] = i_temp;
        }
    }
};

Notes: