-
Notifications
You must be signed in to change notification settings - Fork 8
Expand file tree
/
Copy pathAnagram.java
More file actions
60 lines (46 loc) · 1.66 KB
/
Copy pathAnagram.java
File metadata and controls
60 lines (46 loc) · 1.66 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
package com.inbravo.string;
import java.util.Arrays;
/**
*
* If two strings are made of same chars. A word, phrase, or name formed by rearranging the letters
* of another, such as spar, formed from rasp.
*
* @author amit.dixit
*
*/
public final class Anagram {
public static final void main(final String... args) {
final String firstString = "LOKI";
final String secondString = "KILO";
/* Check if both strings are anagram */
final boolean anagramStatus = checkIfAnagram(firstString, secondString);
System.out.println("----------------------------------------------------");
if (anagramStatus) {
System.out.println("Strings '" + firstString + "' & '" + secondString + "' are Anagrams");
} else {
System.out.println("Strings '" + firstString + "' & '" + secondString + "' are not Anagrams");
}
System.out.println("----------------------------------------------------");
}
/**
* O(2n log n) using Dual Pivot sorting
*
* @param firstString
* @param secondString
* @return
*/
private static final boolean checkIfAnagram(final String firstString, final String secondString) {
/* Sort all chars in both string */
final char[] firstStringChars = firstString.toLowerCase().toCharArray();
final char[] secondStringChars = secondString.toLowerCase().toCharArray();
/* Apply Dual-Pivot Quicksort by Vladimir Yaroslavskiy, Jon Bentley, and Joshua Bloch */
Arrays.sort(firstStringChars);
Arrays.sort(secondStringChars);
/* Check if same */
if (String.valueOf(firstStringChars).equals(String.valueOf(secondStringChars))) {
return true;
} else {
return false;
}
}
}