【Leetcode】792. Number of Matching Subsequences

题目地址：

https://leetcode.com/problems/number-of-matching-subsequences/description/

给定一个长$n$的字符串$s$和若干单词组成的数组$A$，问有多少个单词是$s$的子序列。题目保证只含英文小写字母。

思路是序列自动机，参考https://blog.csdn.net/qq_46105170/article/details/119269166。构造完序列自动机之后只需要将每个单词做一下判断即可。代码如下：

class Solution {
 public:
  int numMatchingSubseq(string s, vector<string>& ws) {
    int n = s.size();
    s = " " + s;
    int dfa[n + 1][26];
    memset(dfa, 0, sizeof dfa);
    for (int i = n - 1; i >= 0; i--) {
      for (int k = 0; k < 26; k++) dfa[i][k] = dfa[i + 1][k];
      dfa[i][s[i + 1] - 'a'] = i + 1;
    }

    auto check = [&](string& s) {
      for (int i = 0, p = 0; i < s.size(); i++) {
        if (!dfa[p][s[i] - 'a']) return false;
        p = dfa[p][s[i] - 'a'];
      }

      return true;
    };

    int res = 0;
    for (auto& w : ws)
      if (check(w)) res++;
    return res;
  }
};

时间复杂度$O(n+\sum l_{A_i})$，空间$O(n)$。