FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
programming/recursion/java/StringPermutation.java at master · Scarlet-Coder/programming · GitHub
Scarlet-Coder
/
programming
Public
forked from
hacktoberfest17/programming
Notifications
You must be signed in to change notification settings
Fork
0
Star
0
Code
Pull requests
0
Actions
Projects
Security and quality
0
Insights
Additional navigation options
Code
Pull requests
Actions
Projects
Security and quality
Insights
Expand file tree
Breadcrumbs
programming
/
recursion
/
java
/
StringPermutation.java
Copy path
More file actions
More file actions
Latest commit
History
History
History
37 lines (34 loc) · 737 Bytes
Breadcrumbs
programming
/
recursion
/
java
/
StringPermutation.java
Copy path
File metadata and controls
37 lines (34 loc) · 737 Bytes
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
// Java program to print all permutations of a given string.
public
class
StringPermutation
{
public
String
swap
(
String
a
,
int
i
,
int
j
)
{
char
temp
;
char
[]
charArray
=
a
.
toCharArray
();
temp
=
charArray
[
i
] ;
charArray
[
i
] =
charArray
[
j
];
charArray
[
j
] =
temp
;
return
String
.
valueOf
(
charArray
);
}
private
void
permute
(
String
str
,
int
l
,
int
r
)
{
if
(
l
==
r
)
System
.
out
.
println
(
str
);
else
{
for
(
int
i
=
l
;
i
<=
r
;
i
++)
{
str
=
swap
(
str
,
l
,
i
);
permute
(
str
,
l
+
1
,
r
);
str
=
swap
(
str
,
l
,
i
);
}
}
}
public
static
void
main
(
String
[]
args
)
{
String
str
=
"ABCD"
;
int
n
=
str
.
length
();
StringPermutation
permutation
=
new
StringPermutation
();
permutation
.
permute
(
str
,
0
,
n
-
1
);
}
}
Back
|
FazBrowse Home
|
New Git URL