LeetCode 0046 - Permutations

Reck Zhang

发布于 2021-08-11 10:34:05

1420

发布于 2021-08-11 10:34:05

文章被收录于专栏：Reck Zhang

Permutations

Desicription

Given a collection of distinct 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],
  [3,2,1]
]

Solution

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

本文参与腾讯云自媒体同步曝光计划，分享自作者个人站点/博客。

原始发表：2017-11-12，如有侵权请联系 cloudcommunity@tencent.com 删除

distinct