forked from TheAlgorithms/Java
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathIsomorphic.java
More file actions
33 lines (29 loc) · 1019 Bytes
/
Copy pathIsomorphic.java
File metadata and controls
33 lines (29 loc) · 1019 Bytes
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
package com.thealgorithms.strings;
import java.util.*;
public class Isomorphic {
public static boolean checkStrings(String s, String t) {
if(s.length() != t.length()){
return false;
}
// To mark the characters of string using MAP
// character of first string as KEY and another as VALUE
// now check occurence by keeping the track with SET data structure
Map<Character, Character> characterMap = new HashMap<Character, Character>();
Set<Character> trackUinqueCharacter = new HashSet<Character>();
for(int i=0; i<s.length(); i++){
if(characterMap.containsKey(s.charAt(i))){
if(t.charAt(i) != characterMap.get(s.charAt(i))){
return false;
}
}
else{
if(trackUinqueCharacter.contains(t.charAt(i))){
return false;
}
characterMap.put(s.charAt(i), t.charAt(i));
}
trackUinqueCharacter.add(t.charAt(i));
}
return true;
}
}