-
Notifications
You must be signed in to change notification settings - Fork 15
Expand file tree
/
Copy pathJavaAnagrams.java
More file actions
63 lines (52 loc) · 1.6 KB
/
JavaAnagrams.java
File metadata and controls
63 lines (52 loc) · 1.6 KB
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
import java.util.Scanner;
public class JavaAnagrams {
static boolean isAnagram(String a, String b) {
// Complete the function
if(a.length() != b.length()) {
return false;
}
String a1 = a.toLowerCase();
String b1 = b.toLowerCase();
char[] arr1 = new char[a.length()];
char[] arr2 = new char[b.length()];
for(int i=0;i<a.length();i++) {
arr1[i] = a1.charAt(i);
}
for(int i=0;i<b.length();i++) {
arr2[i] = b1.charAt(i);
}
for(int i=0;i<a.length();i++){
for(int j=1;j<(a.length()-i);j++){
if(arr1[j] < arr1[j-1]){
char temp = arr1[j];
arr1[j] = arr1[j-1];
arr1[j-1] = temp;
}
}
}
for(int i=0;i<b.length();i++){
for(int j=1;j<(b.length()-i);j++){
if(arr2[j] < arr2[j-1]){
char temp = arr2[j];
arr2[j] = arr2[j-1];
arr2[j-1] = temp;
}
}
}
int n = Math.min(a.length(), b.length());
for(int i=0;i<n;i++) {
if(arr1[i] != arr2[i]) {
return false;
}
}
return true;
}
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
String a = scan.next();
String b = scan.next();
scan.close();
boolean ret = isAnagram(a, b);
System.out.println( (ret) ? "Anagrams" : "Not Anagrams" );
}
}