Package g0701_0800.s0792_number_of_matching_subsequences

Class Solution

java.lang.Object

g0701_0800.s0792_number_of_matching_subsequences.Solution

public class Solution
extends Object

792 - Number of Matching Subsequences\. Medium Given a string `s` and an array of strings `words`, return _the number of_ `words[i]` _that is a subsequence of_ `s`. A **subsequence** of a string is a new string generated from the original string with some characters (can be none) deleted without changing the relative order of the remaining characters. * For example, `"ace"` is a subsequence of `"abcde"`. **Example 1:** **Input:** s = "abcde", words = ["a","bb","acd","ace"] **Output:** 3 **Explanation:** There are three strings in words that are a subsequence of s: "a", "acd", "ace". **Example 2:** **Input:** s = "dsahjpjauf", words = ["ahjpjau","ja","ahbwzgqnuk","tnmlanowax"] **Output:** 2 **Constraints:** * 1 <= s.length <= 5 * 104 * `1 <= words.length <= 5000` * `1 <= words[i].length <= 50` * `s` and `words[i]` consist of only lowercase English letters.

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
int	numMatchingSubseq(String s, String[] words)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

Solution

public Solution()

Method Details

numMatchingSubseq

public int numMatchingSubseq(String s,
 String[] words)