-
Notifications
You must be signed in to change notification settings - Fork 1
/
permutations of a string.cpp
150 lines (100 loc) Β· 2.43 KB
/
permutations of a string.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
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
/*
//////////////////////////////////////////////////////
//Question/Info
Permutations of a given string
Basic Accuracy: 49.85% Submissions: 16142 Points: 1
Given a string S. The task is to print all permutations of a given string.
Example 1:
Input: ABC
Output:
ABC ACB BAC BCA CAB CBA
Explanation:
Given string ABC has permutations in 6
forms as ABC, ACB, BAC, BCA, CAB and CBA .
Example 2:
Input: ABSG
Output:
ABGS ABSG AGBS AGSB ASBG ASGB BAGS
BASG BGAS BGSA BSAG BSGA GABS GASB
GBAS GBSA GSAB GSBA SABG SAGB SBAG
SBGA SGAB SGBA
Explanation:
Given string ABSG has 24 permutations.
Your Task:
You don't need to read input or print anything. Your task is to complete the function find_permutaion() which takes the string S as input parameter and returns a vector of string in lexicographical order.
Expected Time Complexity: O(n! * n)
Expected Space Complexity: O(n)
Constraints:
1 <= length of string <= 5
Company Tags
Accolite Amazon Cisco Citrix MAQ Software OYO Rooms Samsung Snapdeal Walmart Zoho Microsoft
author: srj_v
//////////////////////////////////////////////////////
*/
#include <bits/stdc++.h>
using namespace std;
#define _IOS ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
typedef long double ld;
typedef long long int lli;
#pragma GCC optimize("Ofast")
void c_p_c()
{
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
//////////////////////////////////////////////////////
int32_t main() {
///////////
// c_p_c();
///////////
_IOS
//////////
// code
/*
int t ; cin >> t; while(t--){}
*/
class Solution
{
public:
void permute(string &a, int l, int r, vector<string>&v)
{
// Base case
if (l == r)
{ v.push_back(a);}
else
{
// Permutations made
for (int i = l; i < r; i++)
{
// Swapping done
swap(a[l], a[i]);
// Recursion called
permute(a, l + 1, r, v);
//backtrack
swap(a[l], a[i]);
}
}
}
vector<string>find_permutation(string S)
{
// Code here there
// sort(S.begin(),S.end());
// vector<string> v;
// do{
// v.push_back(S);
// }
// while(next_permutation(S.begin(),S.end()));
// return v;
string a = S;
sort(a.begin(), a.end());
vector<string> v;
permute(a, 0, a.length(), v);
return v;
}
};
// cerr << "time: " << clock() << " ms" << '\n';
return 0;
}
//////////////////////////////////////////////////////