/**
* 给定一个字符串和一个字符串字典,找到字典里面最长的字符串,该字符串可以通过删除给定字符串的某些字符来得到。如果答案不止一个,返回长度最长且字典顺序最小的字符串。如果答案不存在,则返回空字符串。
*
* 示例 1:
*
* 输入:
* s = "abpcplea", d = ["ale","apple","monkey","plea"]
*
* 输出:
* "apple"
* 示例 2:
*
* 输入:
* s = "abpcplea", d = ["a","b","c"]
*
* 输出:
* "a"
* 说明:
*
* 所有输入的字符串只包含小写字母。
* 字典的大小不会超过 1000。
* 所有输入的字符串长度不会超过 1000。
*
* 来源:力扣(LeetCode)
* 链接:https://leetcode-cn.com/problems/longest-word-in-dictionary-through-deleting
* 著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
*/
#include <stack>
#include <vector>
#include <iostream>
#include <random>
#include <algorithm>
#include <stdint.h>
using namespace std;
class Solution {
public:
string findLongestWord(string s, vector<string> &dictionary)
{
for (auto iter = dictionary.begin(); iter != dictionary.end();) {
if (!findWord(s, *iter)) {
iter = dictionary.erase(iter);
} else {
iter++;
}
}
sort(dictionary.begin(), dictionary.end(), [](const string &a, const string &b) {
return a.length() == b.length() ? (a < b) : (b.length() < a.length());
});
return dictionary.empty() ? string{} : dictionary.front();
}
private:
bool findWord(const string &str, const string &word)
{
unsigned w = 0, s = 0;
while (w < word.size() && s < str.size()) {
if (str[s++] == word[w]) {
w++;
}
}
return w == word.size();
}
};