1143. 最长公共子序列 

 1 class Solution 
 2 {
 3 public:
 4     int longestCommonSubsequence(string text1, string text2) 
 5     {
 6         int m = text1.size();
 7         int n = text2.size();
 8         vector<vector<int>> dp(m + 1,vector<int>(n + 1,0));
 9         for(int i = 1;i <= m;i ++)
10         {
11             for(int j = 1;j <= n;j ++)
12             {
13                 if(text1[i - 1] == text2[j - 1]) dp[i][j] = dp[i -1][j - 1] + 1;
14                 else dp[i][j] = max(dp[i - 1][j],dp[i][j - 1]);
15             }
16         }
17         return dp[m][n];
18     }
19 };

 

posted @ 2020-03-19 16:13  Jinxiaobo0509  阅读(102)  评论(0)    收藏  举报