首页 > 代码库 > Leetcode:Permutations 排列

Leetcode:Permutations 排列

2024-07-07 16:17:48   217人阅读

戳我去解题

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

解题分析：首先进行排序，保证结果保持字典序

class Solution {
public:
    vector<vector<int> > permute(vector<int> &num) {
        sort(num.begin(), num.end());
        vector<vector<int> > res;
        res.push_back(num);
        
        while (next_permutation(num.begin(), num.end())) {
            res.push_back(num);
        }
        return res;
    }
};

 

 


联系
我们