题目:
next_permutation排序时,是要看大小的(个人理解大概就是和字典序类似),所以这题需要先将数组进行排序,然后再用全排列,否则会少几种情况!!
代码:
class Solution {
public:
vector<vector<int>> permute(vector<int>& nums) {
vector<vector<int>> ans;
sort(nums.begin(),nums.end()); //先排序
do{
ans.push_back(nums);
}while(next_permutation(nums.begin(),nums.end())); //全排列
return ans;
}
};