-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathanagrams.java
81 lines (64 loc) · 1.95 KB
/
anagrams.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
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
69
70
71
72
73
74
75
76
77
78
79
80
81
import java.util.Scanner;
public class anagrams {
static boolean isAnagram(String a, String b) {
// Complete the function
if (a.length() != b.length()) {
return false;
}
a = a.toLowerCase();
b = b.toLowerCase();
int sum = 0;
for (char c = 'a'; c <= 'z'; c++) {
for (int i=0; i<a.length(); i++) {
if (a.charAt(i) == c) {
sum++;
}
if (b.charAt(i) == c) {
sum--;
}
}
if (sum != 0) {
return false;
}
}
return true;
}
***********************************************************************************
//Anagram by converting String into Character Array.
//Another Method
import java.util.*;
class Main {
public static void main(String[] args) {
Scanner input = new Scanner(System.in);
System.out.print("Enter first String: ");
String str1 = input.nextLine();
System.out.print("Enter second String: ");
String str2 = input.nextLine();
if(str1.length() == str2.length()) {
char[] charArray1 = str1.toCharArray();
char[] charArray2 = str2.toCharArray();
Arrays.sort(charArray1);
Arrays.sort(charArray2);
boolean result = Arrays.equals(charArray1, charArray2);
if(result) {
System.out.println(str1 + " and " + str2 + " are anagram.");
}
else {
System.out.println(str1 + " and " + str2 + " are not anagram.");
}
}
else {
System.out.println(str1 + " and " + str2 + " are not anagram.");
}
input.close();
}
}
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" );
}
}