refactor 1209

fishercoder1534 · fishercoder1534 · commit 930b934922c6 · 2020-08-12T11:59:05.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_1209.java b/src/main/java/com/fishercoder/solutions/_1209.java
@@ -2,37 +2,6 @@
 
 import java.util.Stack;
 
-/**
- * 1209. Remove All Adjacent Duplicates in String II
- *
- * Given a string s, a k duplicate removal consists of choosing k adjacent and equal
- * letters from s and removing them causing the left and the right side of the deleted substring to concatenate together.
- * We repeatedly make k duplicate removals on s until we no longer can.
- * Return the final string after all such duplicate removals have been made.
- * It is guaranteed that the answer is unique.
- *
- * Example 1:
- * Input: s = "abcd", k = 2
- * Output: "abcd"
- * Explanation: There's nothing to delete.
- *
- * Example 2:
- * Input: s = "deeedbbcccbdaa", k = 3
- * Output: "aa"
- * Explanation:
- * First delete "eee" and "ccc", get "ddbbbdaa"
- * Then delete "bbb", get "dddaa"
- * Finally delete "ddd", get "aa"
- *
- * Example 3:
- * Input: s = "pbbcggttciiippooaais", k = 2
- * Output: "ps"
- *
- * Constraints:
- * 1 <= s.length <= 10^5
- * 2 <= k <= 10^4
- * s only contains lower case English letters.
- * */
 public class _1209 {
     public static class Solution1 {
         public String removeDuplicates(String s, int k) {
