原题地址:https://leetcode-cn.com/problems/remove-duplicate-letters/submissions/
题目描述:
给定一个仅包含小写字母的字符串,去除字符串中重复的字母,使得每个字母只出现一次。需保证返回结果的字典序最小(要求不能打乱其他字符的相对位置)。
示例 1:
输入: "bcabc"
输出: "abc"
示例 2:
输入: "cbacdcbc"
输出: "acdb"
解题方案:
参考地址:https://blog.csdn.net/SquirrelYuyu/article/details/83956665
题目提示是栈和贪心算法。
代码:
class Solution {
public:
string removeDuplicateLetters(string s) {
int count[26] = {0};
for(int i = 0; i < s.length(); i++)
count[s[i] - 'a'] ++;
int pos = 0;
for(int i = 0; i < s.length(); i++){
if(s[i] < s[pos])
pos = i;
if(-- count[s[i] - 'a'] == 0)
break;
}
string suffix;
if(pos + 1 > s.length()) suffix = "";
else suffix = s.substr(pos + 1, s.length() - pos - 1);
return s.length() == 0 ? "" : s[pos] + removeDuplicateLetters(removeOneLetter(suffix, s[pos]));
}
string removeOneLetter(string s, char ch){
while(1){
int index = s.find(ch);
if(index != -1) s = s.erase(index, 1);
else break;
}
return s;
}
};