-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathAnagrams.java
More file actions
56 lines (44 loc) · 1.2 KB
/
Anagrams.java
File metadata and controls
56 lines (44 loc) · 1.2 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
import java.util.Scanner;
public class Solution {
// Start Code
/*
https://www.hackerrank.com/challenges/java-anagrams
*/
static boolean isAnagram(String a, String b) {
int lengthA = a.length();
int lengthB = b.length();
if(lengthA != lengthB)
return false;
char[] arrayA = a.toLowerCase().toCharArray();
char[] arrayB = b.toLowerCase().toCharArray();
arrayA = sort(arrayA,lengthA);
arrayB = sort(arrayB,lengthB);
for(int i=0;i<lengthA;i++){
if(arrayA[i] != arrayB[i])
return false;
}
return true;
}
public static char[] sort(char[] arr,int length){
char temp;
for(int i=0;i<length;i++){
for(int j=i;j<length;j++){
if(arr[i]>arr[j]){
temp = arr[i];
arr[i] = arr[j];
arr[j] = temp;
}
}
}
return arr;
}
// End Code
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" );
}
}