FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
JavaScript-Interview-Questions/recursion/006.js at master · devangnpatil/JavaScript-Interview-Questions · GitHub
devangnpatil
/
JavaScript-Interview-Questions
Public
forked from
aishraj/JavaScript-Interview-Questions
Notifications
You must be signed in to change notification settings
Fork
0
Star
0
Code
Pull requests
0
Actions
Projects
Wiki
Security and quality
0
Insights
Additional navigation options
Code
Pull requests
Actions
Projects
Wiki
Security and quality
Insights
Expand file tree
Breadcrumbs
JavaScript-Interview-Questions
/
recursion
/
006.js
Copy path
More file actions
More file actions
Latest commit
History
History
History
178 lines (163 loc) · 2.16 KB
Breadcrumbs
JavaScript-Interview-Questions
/
recursion
/
006.js
Copy path
File metadata and controls
178 lines (163 loc) · 2.16 KB
Raw
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
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
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
/*
* <!--
* This program is distributed under
* the terms of the MIT license.
* Please see the LICENSE file for details.
* -->
*/
/*
* Implement a routine that prints all the permutations of a given string.
* Assume that all of the charactes of the string are unique.
* Example:
* given 'abc', your routine shall produce 'abc' 'acb' 'bac' 'bca' 'cab' 'cba'.
*/
/*____________________________________________________________________________*/
function
permute
(
str
)
{
var
len
=
str
.
length
;
var
used
=
[
]
;
var
output
=
[
]
;
var
input
=
str
.
split
(
''
)
;
doPermute
(
input
,
output
,
used
,
len
,
0
)
;
}
function
doPermute
(
input
,
output
,
used
,
len
,
level
)
{
//console.log('in do permute: '+ level);
if
(
level
===
len
)
{
console
.
log
(
'"'
+
output
.
join
(
''
)
+
'"'
)
;
return
;
}
var
i
=
0
;
for
(
i
=
0
;
i
<
len
;
i
++
)
{
if
(
!
used
[
i
]
)
{
output
.
push
(
input
[
i
]
)
;
used
[
i
]
=
true
;
doPermute
(
input
,
output
,
used
,
len
,
level
+
1
)
;
used
[
i
]
=
false
;
output
.
length
=
output
.
length
-
1
;
}
}
}
/*____________________________________________________________________________*/
permute
(
'SF_CA'
)
;
/*
Output: ($ /usr/bin/node 006.js)
"SF_CA"
"SF_AC"
"SFC_A"
"SFCA_"
"SFA_C"
"SFAC_"
"S_FCA"
"S_FAC"
"S_CFA"
"S_CAF"
"S_AFC"
"S_ACF"
"SCF_A"
"SCFA_"
"SC_FA"
"SC_AF"
"SCAF_"
"SCA_F"
"SAF_C"
"SAFC_"
"SA_FC"
"SA_CF"
"SACF_"
"SAC_F"
"FS_CA"
"FS_AC"
"FSC_A"
"FSCA_"
"FSA_C"
"FSAC_"
"F_SCA"
"F_SAC"
"F_CSA"
"F_CAS"
"F_ASC"
"F_ACS"
"FCS_A"
"FCSA_"
"FC_SA"
"FC_AS"
"FCAS_"
"FCA_S"
"FAS_C"
"FASC_"
"FA_SC"
"FA_CS"
"FACS_"
"FAC_S"
"_SFCA"
"_SFAC"
"_SCFA"
"_SCAF"
"_SAFC"
"_SACF"
"_FSCA"
"_FSAC"
"_FCSA"
"_FCAS"
"_FASC"
"_FACS"
"_CSFA"
"_CSAF"
"_CFSA"
"_CFAS"
"_CASF"
"_CAFS"
"_ASFC"
"_ASCF"
"_AFSC"
"_AFCS"
"_ACSF"
"_ACFS"
"CSF_A"
"CSFA_"
"CS_FA"
"CS_AF"
"CSAF_"
"CSA_F"
"CFS_A"
"CFSA_"
"CF_SA"
"CF_AS"
"CFAS_"
"CFA_S"
"C_SFA"
"C_SAF"
"C_FSA"
"C_FAS"
"C_ASF"
"C_AFS"
"CASF_"
"CAS_F"
"CAFS_"
"CAF_S"
"CA_SF"
"CA_FS"
"ASF_C"
"ASFC_"
"AS_FC"
"AS_CF"
"ASCF_"
"ASC_F"
"AFS_C"
"AFSC_"
"AF_SC"
"AF_CS"
"AFCS_"
"AFC_S"
"A_SFC"
"A_SCF"
"A_FSC"
"A_FCS"
"A_CSF"
"A_CFS"
"ACSF_"
"ACS_F"
"ACFS_"
"ACF_S"
"AC_SF"
"AC_FS"
*/
Back
|
FazBrowse Home
|
New Git URL