2017年12月1日
[LeetCode] 730. Count Different Palindromic Subsequences 计数不同的回文子序列的个数
摘要： Given a string S, find the number of different non-empty palindromic subsequences in S, and return that number modulo 10^9 + 7. A subsequence of a str 阅读全文
posted @ 2017-12-01 14:13 Grandyang 阅读(7571) 评论(9) 推荐(0)
Fork me on GitHub