LeetCode | 524. Longest Word in Dictionary through Deleting

.

题目

Given a string s and a string array dictionary, return the longest string in the dictionary that can be formed by deleting some of the given string characters. If there is more than one possible result, return the longest word with the smallest lexicographical order. If there is no possible result, return the empty string.

Example 1:

Input: s = “abpcplea”, dictionary = [“ale”,“apple”,“monkey”,“plea”]
Output: “apple”

Example 2:

Input: s = “abpcplea”, dictionary = [“a”,“b”,“c”]
Output: “a”

Constraints:

• 1 <= s.length <= 1000
• 1 <= dictionary.length <= 1000
• 1 <= dictionary[i].length <= 1000
• s and dictionary[i] consist of lowercase English letters.

.

代码

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

就是效率有点低2333333~ 欢迎评论区讨论！

.