2020年4月2日
[LC] 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 阅读全文
posted @ 2020-04-02 11:42 xuan_abc 阅读(149) 评论(0) 推荐(0)