String-Programs/ValidAngram.java at master · 6savage9/String-Programs · GitHub

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
package abc;

import java.util.ArrayList;
import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;
import java.util.Set;
import java.util.TreeMap;

public class ValidAngram {

	public boolean isAnagram(String s, String t) {

		if(s.length() == t.length()) {

			String [] str1 = s.split("");
			String [] str2 = t.split("");

			Map m1 = new TreeMap();
			Map m2 = new TreeMap();

			int hash1 = 0;
			int hash2 = 0;

			for(int i=0; i<str1.length; i++) {

				m1.put(str1[i].hashCode(), str1[i]);
				m2.put(str2[i].hashCode(), str2[i]);

				int one = str1[i].hashCode();
				int two = str2[i].hashCode();

				hash1 = hash1 + one;
				hash2 = hash2 + two;

			}

			//System.out.println(m1);
			//System.out.println(m2);

			Set s1 = m1.entrySet();
			ArrayList al1 = new ArrayList(s1);

			//System.out.println(al1);

			Set s2 = m2.entrySet();
			ArrayList al2 = new ArrayList(s2);

		//	System.out.println(al2);

			for(int i=0; i<al1.size(); i++) {

				if(!(al1.get(i).equals(al2.get(i)))) {
				//	System.out.println(al1.get(i)+"  "+al2.get(i));

					return false;
				}
			}

			return true;

		}
		else {
			return false;
		}
	}

	public static void main(String[] args) {

		Scanner sc = new Scanner(System.in);
		String s = sc.next();
		String t = sc.next();

		ValidAngram v =new ValidAngram();
		boolean b = v.isAnagram(s, t);

		System.out.println(b);

	}
}