524. Longest Word in Dictionary through Deleting

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:

1. All the strings in the input will only contain lower-case letters.
2. The size of the dictionary won't exceed 1,000.
3. The length of all the strings in the input won't exceed 1,000.

S：two pointer O(nk)

用two pointer判断每个dict里的词语是否能通过删减s得到，若可以尝试更新result

    string findLongestWord(string s, vector<string>& d) {
        string result = "";
        for (string str : d) {
            if (str.size() < result.size()) continue;
            int j = 0;
            for (int i = 0; i < s.size() && j < str.size(); ++i) {
                if (s[i] == str[j]) j++;
            }
            if (j == str.size() && (str.size() > result.size() || str < result)) {
                result = str;
            }
        }
        return result;
    }