贪心算法
题目描述:
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”
算法分析:
emmmm..这题看起来好像很简单的样子…一开始自信地做了两次…然后愉快地发现都错了(好惨..)
应该说题目隐含的要求比较难完成…“You must make sure your result is the smallest in lexicographical order among all possible results.”返回结果需要是字典序最小的。并不是简单地去除重复。
参考了一下discussion中的解法。
用贪心的方法去不断选取当前串s所要保留的最左字符s[i],可以发现我们必须保证s.substring(i) (即s从下标为i的字符到结尾形成的子串)必须包含s中出现过的所有字符。
我们认为使得s[i]最小的i的最小值是最好的(有点拗口…..但是显然..吧?)根据选取到的i值,获得下一次要处理的串s’。s’ 由s移除s[i]左侧所有字符和与s[i]相等的所有字符得到。
不断处理当前的s并获得新的s’,直到s为空串。每一次处理得到的s[i]所形成的串即为所求的无重复子串。
具体实现:
class Solution {
public:
string removeDuplicateLetters(string s) {
if (s.length() == 0) return s;
string out;
int head = 0;
while (head <= s.length()-1) {
vector<int> max(26, -1);
for (int i = head; i < s.length(); i++) {
max[s[i]-'a'] = i;
}
int rightmost = s.length();
for (int i = 0; i < 26; i++) {
if (max[i] != -1 && max[i] < rightmost)
rightmost = max[i];
}
char minLetter = s[head];
int min_index = head;
for (int i = head; i <= rightmost; i++) {
if (s[i] < minLetter) {
minLetter = s[i];
min_index = i;
}
}
for (int i = min_index+1; i < s.length(); i++) {
if (s[i] == minLetter) {
s.erase(i, 1);
i--;
}
}
out += minLetter;
head = min_index+1;
}
return out;
}
};
提交结果:
286 / 286 test cases passed.
Status: Accepted
Runtime: 6 ms
Submitted: 30 minutes ago
Your runtime beats 14.70 % of cpp submissions.
(还有更优的解题方法….)