Given a string and a string dictionary, find the longest string in the dictionary that can be formed by deleting some characters of the given string. If there are more than one possible results, return the longest word with the smallest lexicographical order. If there is no possible result, return the empty string.
Example 1:
Input: s = "abpcplea", d = ["ale","apple","monkey","plea"] Output: "apple"
Example 2:
Input: s = "abpcplea", d = ["a","b","c"] Output: "a"
Note:
class Solution {
public:
string findLongestWord(string s, vector<string>& d) {
string ans = "";
string temp;
sort(d.begin(), d.end());
for (int i = 0; i < d.size(); ++i) {
temp = helper(s, d[i]);
ans = temp.length() > ans.length() ? temp : ans;
}
return ans;
}
private:
string helper(string s, string d) {
int len = s.length();
int i, j;
for (i = 0, j = 0; i < len && j < s.length();) {
if (s[i] == d[j]) i++, j++;
else i++;
}
if (j == d.length()) return d;
else return "";
}
};
Runtime: 76 ms, faster than 58.66% of C++ online submissions for Longest Word in Dictionary through Deleting.
524. Longest Word in Dictionary through Deleting
原文：https://www.cnblogs.com/ruruozhenhao/p/9880127.html