Sync LeetCode submission Runtime - 31 ms (37.97%), Memory - 27.3 MB (68.47%)

Author: koralkulacoglu

LeetCode/1250-longest-common-subsequence/solution.cpp

@@ -3,16 +3,14 @@ class Solution {
     int longestCommonSubsequence(string text1, string text2) {
         int n = text1.size();
         int m = text2.size();
-
         vector<vector<int>> dp(n+1, vector<int>(m+1, 0));
         for (int i=1; i<=n; i++) {
             for (int j=1; j<=m; j++) {
                 dp[i][j] = max(dp[i][j], dp[i-1][j-1] + (text1[i-1] == text2[j-1]));
-                dp[i][j] = max(dp[i][j], dp[i-1][j]);
                 dp[i][j] = max(dp[i][j], dp[i][j-1]);
+                dp[i][j] = max(dp[i][j], dp[i-1][j]);
             }
         }
-
         return dp[n][m];
     }
 };