-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathAnagram.java
59 lines (37 loc) · 826 Bytes
/
Anagram.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
package random;
import java.util.Arrays;
import java.util.Scanner;
public class Anagram {
public static boolean areAnagram(String s1, String s2)
{
char[] c1 = s1.toCharArray();
char[] c2 = s2.toCharArray();
Arrays.sort(c1);
Arrays.sort(c2);
if(c1.length != c2.length)
{
return false;
}
for(int i =0; i<c1.length; i++)
{
if(c1[i] != c2[i])
{
return false;
}
}
return true;
}
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
System.out.println("Enter first string : ");
String s1 = sc.nextLine();
System.out.println("Enter Second string : ");
String s2 = sc.nextLine();
if(areAnagram(s1, s2))
{
System.out.println("anagrams");
}else {
System.out.println("not anagrams");
}
}
}