FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
Java-Programs/Other-Java-Programs/Anagram.java at master · iamarav/Java-Programs · GitHub
iamarav
/
Java-Programs
Public
Notifications
You must be signed in to change notification settings
Fork
0
Star
2
Code
Issues
0
Pull requests
0
Actions
Projects
Security and quality
0
Insights
Additional navigation options
Code
Issues
Pull requests
Actions
Projects
Security and quality
Insights
Expand file tree
Breadcrumbs
Java-Programs
/
Other-Java-Programs
/
Anagram.java
Copy path
More file actions
More file actions
Latest commit
History
History
History
67 lines (53 loc) · 1.39 KB
Breadcrumbs
Java-Programs
/
Other-Java-Programs
/
Anagram.java
Copy path
File metadata and controls
67 lines (53 loc) · 1.39 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
import
java
.
util
.
Arrays
;
import
java
.
util
.
Scanner
;
public
class
Anagram
{
public
static
void
main
(
String
[]
args
) {
System
.
out
.
println
(
"Program to check if the entered Strings are anagram or not!
\n
---"
);
String
s1
,
s2
;
Scanner
sm
=
new
Scanner
(
System
.
in
);
System
.
out
.
print
(
"Enter first string: "
);
s1
=
sm
.
nextLine
();
System
.
out
.
print
(
"Enter second string: "
);
s2
=
sm
.
nextLine
();
sm
.
close
();
if
(
anagramCheck
(
s1
,
s2
)) {
System
.
out
.
println
(
"The Strings you entered are anagram."
);
}
else
{
System
.
out
.
println
(
"The Strings you entered are not anagram."
);
}
end
();
}
private
static
boolean
anagramCheck
(
String
s1
,
String
s2
) {
boolean
bb
=
true
,
flag
=
false
;
if
(!(
s1
.
length
()==
s2
.
length
())) {
System
.
out
.
println
(
"The lengths of both string are not equal."
);
end
();
}
else
{
// System.out.println("V1 Pass: Length is equal.");
char
[]
a1
=
new
char
[
s1
.
length
()];
char
[]
a2
=
new
char
[
s2
.
length
()];
for
(
int
i
=
0
;
i
<
s1
.
length
();
i
++) {
a1
[
i
]=
s1
.
charAt
(
i
);
a2
[
i
]=
s2
.
charAt
(
i
);
}
Arrays
.
sort
(
a1
);
//Sorting elements of Array
Arrays
.
sort
(
a2
);
for
(
int
j
=
0
;
j
<
s1
.
length
();
j
++) {
if
(
a1
[
j
]!=
a2
[
j
]) {
flag
=
true
;
}
if
(
flag
==
true
) {
bb
=
false
;
break
;
}
}
}
return
bb
;
}
static
void
end
() {
System
.
out
.
println
(
"---
\n
Program has ended."
);
System
.
exit
(
0
);
}
}
Back
|
FazBrowse Home
|
New Git URL