refactor 316

fishercoder1534 · fishercoder1534 · commit cc2c3ec3a407 · 2020-06-03T07:25:24.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_316.java b/src/main/java/com/fishercoder/solutions/_316.java
@@ -3,27 +3,15 @@
 import java.util.ArrayDeque;
 import java.util.Deque;
 
-/**
- * 316. Remove Duplicate Letters
- *
- * Given a string which contains only lowercase letters,
- * remove duplicate letters so that every letter appear once and only once.
- * You must make sure your result is the smallest in lexicographical order among all possible results.
-
- Example:
- Given "bcabc"
- Return "abc"
-
- Given "cbacdcbc"
- Return "acdb"
- */
 public class _316 {
     public static class Solution1 {
-        /** credit: https://discuss.leetcode.com/topic/32259/java-solution-using-stack-with-comments/2 */
+        /**
+         * credit: https://discuss.leetcode.com/topic/32259/java-solution-using-stack-with-comments/2
+         */
         public String removeDuplicateLetters(String s) {
             int[] res = new int[26]; //will contain number of occurences of character (i+'a')
             boolean[] visited =
-                new boolean[26]; //will contain if character (i+'a') is present in current result Stack
+                    new boolean[26]; //will contain if character (i+'a') is present in current result Stack
             char[] ch = s.toCharArray();
             for (char c : ch) {  //count number of occurences of character
                 res[c - 'a']++;
@@ -75,7 +63,7 @@ public String removeDuplicateLetters(String s) {
                 }
             }
             return s.length() == 0 ? "" : s.charAt(pos) + removeDuplicateLetters(
-                s.substring(pos + 1).replaceAll("" + s.charAt(pos), ""));
+                    s.substring(pos + 1).replaceAll("" + s.charAt(pos), ""));
         }
     }
 }
