Longest common stubstring/subsequence given 2 strings as inp

/*
    input: 2 strings
    output: int
    example: "abcde" "acdegg"
    result: 2 (because "cd" is longest substring)
*/
class Solution {
    public int longestCommonSubsequence(String text1, String text2) {
        int[][] result = new int[text1.length()+1][text2.length()+1];
        int max = 0;
        for(int i = 1; i<= text1.length();i++){
            for(int j = 1; j <=text2.length();j++){
                if(text1.charAt(i-1) == text2.charAt(j-1)){
                    result[i][j] = result[i-1][j-1] +1;
                    if(max < result[i][j]){
                        max = result[i][j];
                    }
                }
            }
        }
        return max;
    }
}