Update solution.ts

Author: javadev

src/main/ts/g1101_1200/s1143_longest_common_subsequence/solution.ts

@@ -7,7 +7,6 @@ function longestCommonSubsequence(text1: string, text2: string): number {
     const n: number = text1.length
     const m: number = text2.length
     const dp: number[][] = new Array(n + 1).fill(null).map(() => new Array(m + 1).fill(0))
-
     for (let i = 1; i <= n; i++) {
         for (let j = 1; j <= m; j++) {
             if (text1.charAt(i - 1) === text2.charAt(j - 1)) {
@@ -17,7 +16,6 @@ function longestCommonSubsequence(text1: string, text2: string): number {
             }
         }
     }
-
     return dp[n][m]
 }