2020年3月18日
[LeetCode] 940. Distinct Subsequences II
摘要： Given a string S, count the number of distinct, non-empty subsequences of S . Since the result may be large, return the answer modulo 10^9 + 7. Exampl 阅读全文
posted @ 2020-03-18 03:09 Review->Improve 阅读(193) 评论(0) 推荐(0)