@@ -0,0 +1,555 @@
+class Solution(object):%0A    def findLength(self, A, B):%0A        %22%22%22%0A        :type A: List%5Bint%5D%0A        :type B: List%5Bint%5D%0A        :rtype: int%0A        %22%22%22%0A        lA, lB = len(A), len(B)%0A        if lA %3E lB:%0A            lA, lB = lB, lA%0A            A, B = B, A%0A        ans = 0%0A        prev = %5B0%5D * (lA + 1)%0A        for b in B:%0A            ary = %5B0%5D * (lA + 1)%0A            for j, a in enumerate(A, 1):%0A                if a == b:%0A                    ary%5Bj%5D = prev%5Bj - 1%5D + 1%0A                    ans = max(ans, ary%5Bj%5D)%0A            prev = ary%0A        return ans%0A

Add py solution for 718. Maximum Length of Repeated Subarray