2019年3月27日
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 @ 2019-03-27 22:34 Veritas_des_Liberty 阅读(277) 评论(0) 推荐(0)
935. Knight Dialer
摘要： A chess knight can move as indicated in the chess diagram below: . This time, we place our chess knight on any numbered key of a phone pad (indicated 阅读全文
posted @ 2019-03-27 21:51 Veritas_des_Liberty 阅读(352) 评论(0) 推荐(0)