LongestCommonSubstring

LongestCommonSubstring.java

package com.algorithms;

/**
 * Created by Hadi on 10/25/2016.
 */
public class LongestCommonSubstring {

    public static void main(String[] args){
        System.out.println(longestCommonSubstring("blue","cluees"));
    }

    private static int longestCommonSubstring(String blue, String clues) {
        int[][] V = new int[blue.length()+1][clues.length()+1];

        for(int i=1;i<=blue.length();i++)
            for(int j =1;j<=clues.length();j++){
                if(blue.charAt(i-1)==clues.charAt(j-1)){
                    V[i][j] = V[i-1][j-1] + 1;
                }else{
                    V[i][j] = Math.max(V[i-1][j],V[i][j-1]);
                }
            }

        return V[blue.length()][clues.length()];
    }
}