Leetcode524. Longest Word in Dictionary through Deleting

给定一个字符串和一个字符串字典，找到字典里面最长的字符串，该字符串可以通过删除给定字符串的某些字符来得到。如果答案不止一个，返回长度最长且字典顺序最小的字符串。如果答案不存在，则返回空字符串。

示例 1:

输入: s = “abpcplea”, d = [“ale”,“apple”,“monkey”,“plea”]

输出: “apple” 示例 2:

输入: s = “abpcplea”, d = [“a”,“b”,“c”]

输出: “a” 说明:

所有输入的字符串只包含小写字母。 字典的大小不会超过 1000。 所有输入的字符串长度不会超过 1000。

来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/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: 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.

遍历，需要考虑字典序，76ms

class Solution {
public:
	string findLongestWord(string s, vector<string>& d) {
		int len = d.size(), lens = s.size();
		if (len == 0 || lens == 0) return "";
		string res = "";
		//遍历数组
		for (string word : d) {
			//双指针，长度小跳过
			int i = 0, j = 0;
			for (i = 0; i < lens&&word.size() >= res.size(); ) {
				while (j < word.size() && s[i] == word[j]) {
					++i;
					++j;                   //相等跳过
				}
				++i;                       //不相等跳过
				if (j == word.size()) {      //循环终止
					if (word.size() == res.size()) {
						res = min(res, word);
					}
					else res = word;     
					break;
				}
			}
		}
		return res;
	}
};