Uncrossed Lines Python Solution with Tests

lcpy gen -n 1035   # by problem number
lcpy gen -s uncrossed_lines   # by problem name

Input: nums1 = [1,4,2], nums2 = [1,2,4]
Output: 2
Explanation: We can draw 2 uncrossed lines as in the diagram.
We cannot draw 3 uncrossed lines, because the line from nums1[1] = 4 to nums2[2] = 4 will intersect the line from nums1[2]=2 to nums2[1]=2.

Input: nums1 = [2,5,1,2,5], nums2 = [10,5,2,1,5,2]
Output: 3

Input: nums1 = [1,3,7,1,7,5], nums2 = [1,9,2,5,1]
Output: 2

class Solution:
    # Time: O(m * n)
    # Space: O(min(m, n))
    def max_uncrossed_lines(self, nums1: list[int], nums2: list[int]) -> int:
        if len(nums2) < len(nums1):
            nums1, nums2 = nums2, nums1
        prev = [0] * (len(nums2) + 1)
        for a in nums1:
            curr = [0] * (len(nums2) + 1)
            for j, b in enumerate(nums2):
                if a == b:
                    curr[j + 1] = prev[j] + 1
                else:
                    curr[j + 1] = max(prev[j + 1], curr[j])
            prev = curr
        return prev[-1]