p1035

Author: Frederick-S

Diff for: leetcode/algorithms/p1035_uncrossed_lines.py

@@ -0,0 +1,14 @@
+import collections
+from typing import List
+
+
+class Solution:
+    def maxUncrossedLines(self, nums1: List[int], nums2: List[int]) -> int:
+        dp = collections.defaultdict(int)
+        m, n = len(nums1), len(nums2)
+
+        for i in range(m):
+            for j in range(n):
+                dp[i, j] = max(dp[i - 1, j - 1] + (nums1[i] == nums2[j]), dp[i - 1, j], dp[i, j - 1])
+        
+        return dp[m - 1, n - 1]

Diff for: tests/algorithms/p1035_uncrossed_lines_test.py

@@ -0,0 +1,13 @@
+import unittest
+from leetcode.algorithms.p1035_uncrossed_lines import Solution
+
+
+class TestUncrossedLines(unittest.TestCase):
+    def test_uncrossed_lines(self):
+        solution = Solution()
+
+        self.assertEqual(2, solution.maxUncrossedLines([1, 4, 2], [1, 2, 4]))
+        self.assertEqual(3, solution.maxUncrossedLines(
+            [2, 5, 1, 2, 5], [10, 5, 2, 1, 5, 2]))
+        self.assertEqual(2, solution.maxUncrossedLines(
+            [1, 3, 7, 1, 7, 5], [1, 9, 2, 5, 1]))