mirror of
https://github.com/TheAlgorithms/Java.git
synced 2025-07-23 04:20:16 +08:00
refactor: fix typo (#5372)
This commit is contained in:
@ -17,8 +17,8 @@ public final class Isomorphic {
|
||||
// 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>();
|
||||
Map<Character, Character> characterMap = new HashMap<>();
|
||||
Set<Character> trackUniqueCharacter = new HashSet<>();
|
||||
|
||||
for (int i = 0; i < s.length(); i++) {
|
||||
if (characterMap.containsKey(s.charAt(i))) {
|
||||
@ -26,13 +26,13 @@ public final class Isomorphic {
|
||||
return false;
|
||||
}
|
||||
} else {
|
||||
if (trackUinqueCharacter.contains(t.charAt(i))) {
|
||||
if (trackUniqueCharacter.contains(t.charAt(i))) {
|
||||
return false;
|
||||
}
|
||||
|
||||
characterMap.put(s.charAt(i), t.charAt(i));
|
||||
}
|
||||
trackUinqueCharacter.add(t.charAt(i));
|
||||
trackUniqueCharacter.add(t.charAt(i));
|
||||
}
|
||||
return true;
|
||||
}
|
||||
|
Reference in New Issue
Block a user