leetcode---C++实现---524. Longest Word in Dictionary through Deleting（通过删除字母匹配到字典里最长单词）

题目

level：medium

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）
链接：https://leetcode-cn.com/problems/longest-word-in-dictionary-through-deleting

解题思路

1. 遍历字典，判断字典中的单词是否是给定字符串的子串，若是子串，则记录下来；
2. 继续遍历字典，若当前单词比上次记录的子串短，或长度相等的情况下，当前单词中字母更靠后，则无需进行判断是否是给定字符串的子串；否则判断子串，若符合条件，则将最大子串更新。

算法实现（C++）

class Solution {
public:
    string findLongestWord(string s, vector<string>& d) 
    {
        string str = "";
        for(int i = 0; i < d.size(); ++i)
        {
            int tag = str.length();
            int leng = d[i].length();
            //若字符串更短或者一样长且字母顺序较大的直接舍去
            if(tag > leng || (tag == leng && str.compare(d[i]) < 0))
                continue;
            
            if(isSubStr(s, d[i]))
            {
                str = d[i];
            }
        }
        return str;
    }
    
private:
	bool isSubStr(string wholeStr, string subStr) 
    {
        int j = 0;
        for (int i = 0; i < wholeStr.length() && j < subStr.length(); ++i)//从左往右遍历，检测是否为子串
        {
            if (wholeStr[i] == subStr[j])
                ++j;
        }
        return j == subStr.length();
    }
}

复杂度分析

• 时间复杂度：O(n*x)，n 为vector大小，x 为vector里元素的平均长度；vector中每个元素均需遍历，需要判断元素是否为子串时，需要遍历字符串长度次；
• 空间复杂度：O(1)，只需分配最长单词的长度。