refactor 467

fishercoder1534 · fishercoder1534 · commit 1f86c40c620f · 2020-07-11T08:55:33.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_467.java b/src/main/java/com/fishercoder/solutions/_467.java
@@ -1,30 +1,5 @@
 package com.fishercoder.solutions;
 
-/**
- * 467. Unique Substrings in Wraparound String
- *
- * Consider the string s to be the infinite wraparound string of "abcdefghijklmnopqrstuvwxyz",
- * so s will look like this: "...zabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcd....".
- * Now we have another string p.
- * Your job is to find out how many unique non-empty substrings of p are present in s.
- * In particular, your input is the string p and you need to output the number of different non-empty substrings of p in the string s.
- * Note: p consists of only lowercase English letters and the size of p might be over 10000.
-
- Example 1:
- Input: "a"
- Output: 1
- Explanation: Only the substring "a" of string "a" is in the string s.
-
- Example 2:
- Input: "cac"
- Output: 2
- Explanation: There are two substrings "a", "c" of string "cac" in the string s.
-
- Example 3:
- Input: "zab"
- Output: 6
- Explanation: There are six substrings "z", "a", "b", "za", "ab", "zab" of string "zab" in the string s.
- */
 public class _467 {
     public static class Solution1 {
         /**
