Dynamic Programming — Strings

Smrita Pokharel

·

Follow

Apr 12, 2021

--

Listen

Share

class Solution {
    
    public int longestCommonSubsequence(String text1, String text2) {
        
        int row = text1.length();
        int col = text2.length();
        
        int[][] dp = new int[row+1][col+1];
        
        for(int i =1;i<=row;i++){
            for(int j =1;j<=col;j++){
                
                char rc = text1.charAt(i-1);
                char cc = text2.charAt(j-1);
                
                if(rc==cc){
                    dp[i][j] = dp[i-1][j-1] +1;
                }else{
                    dp[i][j] = max(dp[i-1][j],dp[i][j-1]);
                }
                    
            }
        }
        
        return dp[row][col];
        
    }
    
    private int max(int a,int b){
        if(a>b){
            return a;
        }
        
        return b;
    }
}