Skip to content

Commit a7cd97d

Browse files
authored
refactor: fix typo (#5372)
1 parent 75355e8 commit a7cd97d

File tree

2 files changed

+6
-6
lines changed

2 files changed

+6
-6
lines changed

src/main/java/com/thealgorithms/others/GuassLegendre.java renamed to src/main/java/com/thealgorithms/others/GaussLegendre.java

+2-2
Original file line numberDiff line numberDiff line change
@@ -6,8 +6,8 @@
66
*
77
* @author AKS1996
88
*/
9-
public final class GuassLegendre {
10-
private GuassLegendre() {
9+
public final class GaussLegendre {
10+
private GaussLegendre() {
1111
}
1212

1313
public static void main(String[] args) {

src/main/java/com/thealgorithms/strings/Isomorphic.java

+4-4
Original file line numberDiff line numberDiff line change
@@ -17,22 +17,22 @@ public static boolean checkStrings(String s, String t) {
1717
// To mark the characters of string using MAP
1818
// character of first string as KEY and another as VALUE
1919
// now check occurence by keeping the track with SET data structure
20-
Map<Character, Character> characterMap = new HashMap<Character, Character>();
21-
Set<Character> trackUinqueCharacter = new HashSet<Character>();
20+
Map<Character, Character> characterMap = new HashMap<>();
21+
Set<Character> trackUniqueCharacter = new HashSet<>();
2222

2323
for (int i = 0; i < s.length(); i++) {
2424
if (characterMap.containsKey(s.charAt(i))) {
2525
if (t.charAt(i) != characterMap.get(s.charAt(i))) {
2626
return false;
2727
}
2828
} else {
29-
if (trackUinqueCharacter.contains(t.charAt(i))) {
29+
if (trackUniqueCharacter.contains(t.charAt(i))) {
3030
return false;
3131
}
3232

3333
characterMap.put(s.charAt(i), t.charAt(i));
3434
}
35-
trackUinqueCharacter.add(t.charAt(i));
35+
trackUniqueCharacter.add(t.charAt(i));
3636
}
3737
return true;
3838
}

0 commit comments

Comments
 (0)