LeetCode-Permutations

最新推荐文章于 2024-11-17 18:49:52 发布

所难

最新推荐文章于 2024-11-17 18:49:52 发布

阅读量322

点赞数

分类专栏： Cracking LeetCode Permutation 文章标签： leetcode Permutations

本文链接：https://blog.csdn.net/HolyDominat/article/details/38583281

版权

Cracking LeetCode 同时被 2 个专栏收录

152 篇文章 0 订阅

订阅专栏

Permutation

4 篇文章 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].

Solution:

Code:

<span style="font-size:14px;">class Solution {
public:
    void helper(vector<vector<int> > &results, vector<int> &num, const int &length, int index) {
        if (index == length) {
            results.push_back(num);
            return;
        }
        helper(results, num, length, index+1);
        for (int i = index+1; i < length; ++i) {
            swap(num[index], num[i]);
            helper(results, num, length, index+1);
            swap(num[index], num[i]);
        }
    }
    
    vector<vector<int> > permute(vector<int> &num) {
        const int length = num.size();
        vector<vector<int> > results;
        if (length == 0) return results;
        if (length == 1) {
            results.push_back(num);
            return results;
        }
        sort(num.begin(), num.end());
        helper(results, num, length, 0);
        return results;
    }
};</span>