0792.number-of-matching-subsequences

792. Number of Matching Subsequences

题目

Given string S and a dictionary of words words, find the number of words[i] that is a subsequence of S.

Example :
Input:
S = "abcde"
words = ["a", "bb", "acd", "ace"]
Output: 3
Explanation: There are three words in words that are a subsequence of S: "a", "acd", "ace".

Note:

1. All words in words and S will only consists of lowercase letters.
2. The length of S will be in the range of [1, 50000].
3. The length of words will be in the range of [1, 5000].
4. The length of words[i] will be in the range of [1, 50].

解题思路

见程序注释