Leetcode 524. Longest Word in Dictionary through Deleting 通过删除字母匹配到字典里最长单词

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.

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.

示例:

Example 1:

Input:
s = "abpcplea", d = ["ale","apple","monkey","plea"]
Output: 
"apple"

Example 2:

Input:
s = "abpcplea", d = ["a","b","c"]
Output: 
"a"

解答

这道题暴力搜索，对于d中的每一个字符串，都看看这个字符串是否是s的字串，如果是的话，并且长度满足条件，就更新返回结果。

代码

class Solution {
public:
    string findLongestWord(string s, vector<string>& d) {
        string res = "";
        for ( auto & str : d) {
            int i = 0;
            for (int j = 0; j < s.size(); j ++) {
                if (s[j] == str[i])
                    i ++;
            }
            if (i == str.size()) {
                if (str.size() > res.size() || (str.size() == res.size() && res.compare(str) > 0))
                    res = str;
            }           
            
        }
        return res;
    }
};