-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathStringAnagram.java
More file actions
68 lines (53 loc) · 2.02 KB
/
StringAnagram.java
File metadata and controls
68 lines (53 loc) · 2.02 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
64
65
66
67
68
import java.util.Scanner;
import java.util.Arrays;
public class StringAnagram {
static boolean isAnagram(String a, String b) {
if (a.length() != b.length())
return false;
a = a.toLowerCase();
b = b.toLowerCase();
int count = 0;
for (int index = 0; index < a.length(); index++) {
int countOfCharacterFromA = 0;
int countOfCharacterFromB = 0;
for (int internalIndex = 0; internalIndex < a.length(); internalIndex++) {
if (a.charAt(index) == a.charAt(internalIndex))
countOfCharacterFromA += 1;
if (a.charAt(index) == b.charAt(internalIndex))
countOfCharacterFromB += 1;
}
if (countOfCharacterFromA == countOfCharacterFromB)
count += 1;
countOfCharacterFromA = 0;
countOfCharacterFromB = 0;
}
if (a.length() == count)
return true;
else
return false;
}
static boolean isAnagram2(String s, String t) {
if (s.length() != t.length())
return false;
char sc[] = s.toCharArray();
char tc[] = t.toCharArray();
Arrays.sort(sc);
Arrays.sort(tc);
for (int i = 0; i < s.length(); i++)
if (sc[i] != tc[i])
return false;
return true;
}
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
System.out.print("String 1: ");
String a = sc.next();
System.out.print("String 2: ");
String b = sc.next();
sc.close();
boolean result = isAnagram(a, b);
System.out.println("Result using isAnagram function: " + (result?"Strings are Anagram":"Strings are not Anagram"));
result = isAnagram2(a, b);
System.out.println("Result using isAnagram2 function: " + (result?"Strings are Anagram":"Strings are not Anagram"));
}
}