Leetcode 316. Remove Duplicate Letters

<span style="font-family: 'Helvetica Neue', Helvetica, Arial, sans-serif; background-color: rgb(255, 255, 255);">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.</span>

Example:

Given "bcabc"
Return "abc"

Given "cbacdcbc"

Return "acdb"

深度搜索把number最小的char放在result的最前面， 需要返回一个最小的序数的字符串

这个显然是太慢了

code

public class Solution1 {
    public String removeDuplicateLetters(String s) {
        int[] cnt = new int[26];
        int pos = 0; // the position for the smallest s[i]
        for (int i = 0; i < s.length(); i++) cnt[s.charAt(i) - 'a']++;
        for (int i = 0; i < s.length(); i++) {
            if (s.charAt(i) < s.charAt(pos)) pos = i;
            if (--cnt[s.charAt(i) - 'a'] == 0) break;
        }
        return s.length() == 0 ? "" : s.charAt(pos) + removeDuplicateLetters(s.substring(pos + 1).replaceAll("" + s.charAt(pos), ""));
    }
}

其他的方法看这里，我还没有搞懂

http://aidenhu.blogspot.com/2016/01/316-remove-duplicate-letters.html