refactor 1003

fishercoder1534 · fishercoder1534 · commit a2d91bb96ec3 · 2020-08-03T17:16:21.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_1003.java b/src/main/java/com/fishercoder/solutions/_1003.java
@@ -3,22 +3,6 @@
 import java.util.ArrayDeque;
 import java.util.Deque;
 
-/**
- * 1003. Check If Word Is Valid After Substitutions
- *
- * We are given that the string "abc" is valid.
- *
- * From any valid string V, we may split V into two pieces X and Y such that X + Y (X concatenated with Y) is equal to V.  (X or Y may be empty.)  Then, X + "abc" + Y is also valid.
- *
- * If for example S = "abc", then examples of valid strings are: "abc", "aabcbc", "abcabc", "abcabcababcc".  Examples of invalid strings are: "abccba", "ab", "cababc", "bac".
- *
- * Return true if and only if the given string S is valid.
- *
- * Note:
- *  * 1 <= S.length <= 20000
- *  * S[i] is 'a', 'b', or 'c'
- */
-
 public class _1003 {
     public static class Solution1 {
         public boolean isValid(String S) {
