剑指offer38 数字排列
输入一组数字(可能包含重复数字),输出其所有的排列方式。
样例
输入:
[1,2,3]
输出:
[
[1,2,3],
[1,3,2],
[2,1,3],
[2,3,1],
[3,1,2],
[3,2,1]
]
思路:
AcWing-51 C++ code:
class Solution {
public:
void permutation_core(vector<int> nums, vector<vector<int> >& res, int now_id) {
if(now_id == nums.size() - 1 && find(res.begin(), res.end(), nums) == res.end()){
res.push_back(nums);
}else{
for(int i = now_id; i < nums.size(); i++){
int temp = nums[now_id];
nums[now_id] = nums[i];
nums[i] = temp;
permutation_core(nums, res, now_id + 1);
temp = nums[now_id];
nums[now_id] = nums[i];
nums[i] = temp;
}
}
}
vector<vector<int>> permutation(vector<int>& nums) {
if(nums.size() == 0){
return {};
}
vector<vector<int>> res;
permutation_core(nums, res, 0);
return res;
}
};