1143-Longest-Common-Subsequence.ts

function longestCommonSubsequence(text1: string, text2: string): number {
    let temp: number[][] = [];
    let max: number = 0;
    for (let i = 0; i <= text1.length; i++) {
        temp.push(new Array(text2.length + 1).fill(0));
    }

    for (let i = 1; i < temp.length; i++) {
        for (let j = 1; j < temp[0].length; j++) {
            if (text1[i - 1] === text2[j - 1]) {
                temp[i][j] = temp[i - 1][j - 1] + 1;
            } else {
                temp[i][j] = Math.max(temp[i - 1][j], temp[i][j - 1]);
            }
            max = Math.max(max, temp[i][j]);
        }
    }

    return max;
}