-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathStringAnagram.java
38 lines (34 loc) · 1.05 KB
/
StringAnagram.java
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
import java.util.Scanner;
public class Solution16 {
static boolean isAnagram(String a, String b) {
boolean ret = false;
a=a.toLowerCase();
b=b.toLowerCase();
boolean visited[] =new boolean[b.length()];
if (a.length()==b.length()) {
for (int i = 0; i < a.length(); i++) {
char c = a.charAt(i);
ret = false;
for (int j = 0; j < b.length(); j++) {
if (b.charAt(j) == c && !visited[j]) {
visited[j]= true;
ret = true;
break;
}
}
if (!ret) {
break;
}
}
}
return ret;
}
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" );
}
}