LeetCode:Permutations

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

 

解法一：使用STL的next_permutation,函数原型参照c++ reference

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

解法二：

 next_permutation自己实现

 http://www.cnblogs.com/xiaoying1245970347/p/4563062.html

解法三：遍历排列数后期补上。