Leetcode 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.

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.

解题：
解法1：找出字符串所有的子序列，然后和数组里的字符串比较；这种办法时间、空间开销巨大，不推荐。
解法2：对数组里的字符串，按照1.长度；2.字典序排序，从大到小，找出第一个是s子序列的。
关键是判定子序列的方法
这里，我们的方法是：对数组中的序列中a的字符，逐个在s中找和这个字符相同的，找到才找下一个。直到找全a或者s。如果找全的是a，则是子序列。
贴代码：

class Solution {
public:
    static bool compareString(string a, string b) {
        if (a.length() == b.length()) {
            return a < b;
        }
        return a.length() > b.length();
    }
    bool helper(string s, string a) {
        int index = 0;
        for (int i = 0; i < s.size(); i++) {
            if (index < a.size() && s[i] == a[index]) {
                index++;
            }
        }
        if (index == a.size()) {
            return true;
        }
        return false;
    }
    string findLongestWord(string s, vector<string>& d) {
        sort(d.begin(), d.end(), compareString);
        int n = d.size();
        for (int i = 0; i < n; i++) {
            if (helper(s, d[i])) {
                return d[i];
            }
        }
        return "";
    }
};