refactor 205

fishercoder1534 · fishercoder1534 · commit 58282d89f6ab · 2021-07-12T07:08:15.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_205.java b/src/main/java/com/fishercoder/solutions/_205.java
@@ -2,26 +2,11 @@
 
 import java.util.HashMap;
 import java.util.Map;
-/**
- * 205. Isomorphic Strings
- *
- * Given two strings s and t, determine if they are isomorphic.
 
- Two strings are isomorphic if the characters in s can be replaced to get t.
-
- All occurrences of a character must be replaced with another character while preserving the order of characters. No two characters may map to the same character but a character may map to itself.
-
- For example,
- Given "egg", "add", return true.
-
- Given "foo", "bar", return false.
-
- Given "paper", "title", return true.
-
- Note:
- You may assume both s and t have the same length.*/
 public class _205 {
-    /**space should be O(1) since it only has alphabetic letters which are capped at 52.*/
+    /**
+     * space should be O(1) since it only has alphabetic letters which are capped at 52.
+     */
 
     public static class Solution1 {
         public boolean isIsomorphic(String s, String t) {
