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:
- All the strings in the input will only contain lower-case letters.
- The size of the dictionary won't exceed 1,000.
- The length of all the strings in the input won't exceed 1,000.
分析
这道题和[LeetCode 792] Number of Matching Subsequences 解法相同。我们在寻找word是否在s中时,只需要使用vector<set<int>>记录[a-z]在s中出现的位置即可。为了得到最大长度字符串,首先通过长度和字符串的大小进行排序。然后遍历word,每一个word记录当前的start位置,寻找word[i]在s中出现的大于start的位置,可以使用set::upper_bound来寻找。
Code
class Solution {
public:
static bool cmp(const string& a, const string& b)
{
return a.size() > b.size() || (a.size() == b.size() && a < b);
}
string findLongestWord(string s, vector<string>& d) {
int sLen = s.size();
int dLen = d.size();
vector<set<int>> index(26);
for (int i = 0; i < sLen; i ++)
{
index[s[i] - 'a'].insert(i);
}
sort(d.begin(), d.end(), cmp);
string res;
vector<int> start(dLen, -1);
for (int i = 0; i < dLen; i ++)
{
int j = 0;
for (j = 0; j < d[i].size(); j ++)
{
int c = d[i][j] - 'a';
set<int>::iterator it = index[c].upper_bound(start[i]);
if (it == index[c].end())
break;
start[i] = *it;
}
if (j == d[i].size())
{
res = d[i];
return res;
}
}
return "";
}
};
运行效率
Runtime: 84 ms, faster than 89.81% of C++ online submissions for Longest Word in Dictionary through Deleting.
Memory Usage: 17 MB, less than 56.84% of C++ online submissions forLongest Word in Dictionary through Deleting.