LeetCode 1143 最长公共子序列

class Solution {
public:
    
    int longestCommonSubsequence(string text1, string text2) {
       int len1=text1.size();
       int len2=text2.size();
       int dp[len1+1][len2+1];//dp[i][j]保存text[0,i-1]与text[0,j-1]的LCS
       for(int i=0;i<=len1;++i){//边界条件处理
           dp[i][0]=0;
       }
       for(int j=0;j<=len2;++j){
           dp[0][j]=0;
       }
      for(int i=1;i<=len1;++i){
          for(int j=1;j<=len2;++j){
              if(text1[i-1]==text2[j-1]){
                  dp[i][j]=dp[i-1][j-1]+1;
              }
              else{
                  dp[i][j]=max(dp[i-1][j],dp[i][j-1]);
              }
          }
      }
      return dp[len1][len2];
    }
};