题目:
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]解析:
STL库中有解决次类题目的函数,如果给定的数组是递增的那么我们可以调用next_permutation()函数,反之,递减数组可以调用prev_permutation()函数,如果无序的则可以先排序再根据情况调用,此题我就是先排序后直接调用函数解决的。
程序答案:
class Solution {
public:
vector<vector<int> > permute(vector<int> &num) {
vector<vector<int> > result;
sort(num.begin(),num.end());
result.push_back(num);
while (next_permutation(num.begin(),num.end()))
{
result.push_back(num);
}
return result;
}
};