Runtime: 6 ms (Top 95.21%) | Memory: 10.00 MB (Top 97.6%)

Author: AnasImloul

scripts/algorithms/U/Uncrossed Lines/Uncrossed Lines.cpp

@@ -1,23 +1,27 @@
+// Runtime: 6 ms (Top 95.21%) | Memory: 10.00 MB (Top 97.6%)
+
 class Solution {
 public:
-    int solve(int n1,int n2,vector<int>& nums1, vector<int>& nums2,vector<vector<int>> &dp)
-    {
-        if(n1<0 || n2<0)
-            return 0;
-        
-        if(dp[n1][n2]!=-1)
-            return dp[n1][n2];
-        
-        if(nums1[n1]==nums2[n2])
-            return dp[n1][n2]=1+solve(n1-1,n2-1,nums1,nums2,dp);
-        
-        return dp[n1][n2]=max(solve(n1-1,n2,nums1,nums2,dp),solve(n1,n2-1,nums1,nums2,dp));
-    }
-    
     int maxUncrossedLines(vector<int>& nums1, vector<int>& nums2) {
-        int n1=nums1.size(),n2=nums2.size();
-        vector<vector<int>> dp(n1+1,vector<int>(n2+1,-1));
-        
-        return solve(n1-1,n2-1,nums1,nums2,dp);
+        int m = nums1.size(), n = nums2.size();
+        if (m < n) {
+            swap(nums1, nums2);
+            swap(m, n);
+        }
+        vector<int> dp(n + 1);
+        for (int i = 1; i <= m; i++) {
+            int prev = 0;
+            for (int j = 1; j <= n; j++) {
+                int curr = dp[j];
+                if (nums1[i-1] == nums2[j-1]) {
+                    dp[j] = prev + 1;
+                } else {
+                    dp[j] = max(dp[j-1], curr);
+                }
+                prev = curr;
+            }
+        }
+        return dp[n];
     }
 };
+