-
Notifications
You must be signed in to change notification settings - Fork 0
/
permuate2.cpp
42 lines (39 loc) · 899 Bytes
/
permuate2.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
#include <iostream>
#include<bits/stdc++.h>
using namespace std;
void helper(vector<int> a, vector<vector<int>> &ans,int idx){
if(idx == a.size()){
ans.push_back(a);
return;
}
for(int i=idx;i<a.size();i++){
if(i != idx && a[i]==a[idx]){
continue;
// bcoz agar same elemet ko hum swap karenge to fir voh duplictaes create karga isliye continue
}
swap(a[i],a[idx]);
helper(a,ans,idx+1);
}
}
vector<vector<int>> permute(vector<int> nums){
sort(nums.begin(),nums.end());
vector<vector<int>> ans;
helper(nums,ans,0);
return ans;
}
int main()
{
int n;
cin>>n;
vector<int> a(n);
for(auto &i:a){
cin>>i;
}
vector<vector<int>> res = permute(a);
for(auto v: res){
for(auto i : v){
cout<<i<<" ";
}cout<<endl;
}
return 0;
}