leetcode-524 最长子序列 C++

**524. Longest Word in Dictionary through Deleting
Medium

305

165

Favorite
删除 s 中的一些字符，使得它构成字符串列表 d 中的一个字符串，找出能构成的最长字符串。如果有多个相同长度的结果，返回字典序的最小字符串。

Share
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”**

代码

class Solution {
public:
    string findLongestWord(string s, vector<string>& d) {
        string longWord="";//初始化空字符串
        for(int i=0;i<d.size();i+&