LeetCode 316. Remove Duplicate Letters

316. Remove Duplicate Letters

Hard

Given a string which contains only lowercase letters, remove duplicate letters so that every letter appears once and only once. You must make sure your result is the smallest in lexicographical order among all possible results.

Example 1:

Input: “bcabc”
Output: “abc”
Example 2:

Input: “cbacdcbc”
Output: “acdb”

题意

给定一个字符串，要求每个字符只出现一个的子串，而且在满足条件的子串中，取字典序最小者

思路

用栈保存当前取到的子串，将新的字符压栈前，弹出栈尾比当前字符大且后面还会再次出现的字符

代码

class Solution {
    public String removeDuplicateLetters(String s) {
        int n = s.length(), i = 0;
        int[] cnt = new int[26];
        boolean[] use = new boolean[26];
        LinkedList<Character> stack = new LinkedList<Character>();
        char[] carr = s.toCharArray();
        for (char ch: carr) {
            ++cnt[ch - 'a'];
        }
        for (char ch: carr) {
            --cnt[ch - 'a'];
            if (!use[ch - 'a']) {
                while (!stack.isEmpty() && ch <= stack.getLast() && cnt[stack.getLast() - 'a'] > 0) {
                    use[stack.pollLast() - 'a'] = false;
                }
                stack.add(ch);
                use[ch - 'a'] = true;
            }
        }
        StringBuilder sb = new StringBuilder();
        for (char ch: stack) {
            sb.append(ch);
        }
        return sb.toString();
    }
}