2018年6月19日
[LeetCode] 792. Number of Matching Subsequences 匹配的子序列的个数
摘要： 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 ge 阅读全文
posted @ 2018-06-19 21:53 Grandyang 阅读(7070) 评论(0) 推荐(0)
Fork me on GitHub