refactor 3

Author: fishercoder1534

src/main/java/com/fishercoder/solutions/_3.java

@@ -5,22 +5,6 @@
 import java.util.Map;
 import java.util.Set;
 
-/**
- * 3. Longest Substring Without Repeating Characters
- *
- * Given a string, find the length of the longest substring without repeating characters.
-
- Examples:
-
- Given "abcabcbb", the answer is "abc", which the length is 3.
-
- Given "bbbbb", the answer is "b", with the length of 1.
-
- Given "pwwkew", the answer is "wke", with the length of 3.
-
- Note that the answer must be a substring, "pwke" is a subsequence and not a substring.
- */
-
 public class _3 {
 
     public static class Solution1 {