Ryan

摘要： Solution: when see question about two strings , DP should be considered first.We can abstract this question to calculate appear times for string T wit... 阅读全文

摘要： 属于中规中矩的dp。和unique paths类似。一次ac。但是可以通过滚动数组来节省存储空间。 1 #include 2 #include 3 #include 4 using namespace std; 5 6 class Solution { 7 public: 8 int... 阅读全文