LeetCode 46. Permutations

描述

求出一个数组的所有排列

解决

利用std::next_permutation()

---

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