LeetCode Permutation

Permutations

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:

class Solution {
public:
vector<vector<int> > permute(vector<int> &num) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
sort(num.begin(),num.end());
vector<vector<int> > result;
do{
result.push_back(num);
}while(next_permutation(num.begin(),num.end()));
return result;
}
};