首页 > itarticle > leetcode 0316

leetcode 0316

admin 11月 13, 2020 0

Desicription

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 1:

1 2	Input: "bcabc" Output: "abc"

Example 2:

1 2	Input: "cbacdcbc" Output: "acdb"

Solution

class  {
public:
    std::string removeDuplicateLetters(std::string s) {
        auto visit = std::map<char, bool>();
        auto count = std::map<char, int>();

        for(auto c : s) {
            count[c]++;
        }

        auto res = std::string();
        for(auto c : s) {
            count[c]--;

            if(visit[c]) {
                continue;
            }

            while(!res.empty() && c < res.back() && count[res.back()] != 0) {
                visit[res.back()] = false;
                res.pop_back();
            }

            res += c;
            visit[c] = true;
        }

        return res;
    }
};