comefrom: <doocs>0718.Maximum Length of Repeated Subarray_1.py
code: def findLength( nums1: List[int], nums2: List[int]) -> int:
      m, n = len(nums1), len(nums2)
      dp = [[0] * (n + 1) for _ in range(m + 1)]
      ans = 0
      for i in range(1, m + 1):
          for j in range(1, n + 1):
              if nums1[i - 1] == nums2[j - 1]:
                  dp[i][j] = 1 + dp[i - 1][j - 1]
                  ans = max(ans, dp[i][j])
      return ans
masked: def sample_funcname ( var_0 : List [ int ] , var_1 : List [ int ] ) -> int :
      var_2 , var_3 = len ( var_0 ) , len ( var_1 )
      var_5 = [ [ 0 ] * ( var_3 + 1 ) for var_4 in range ( var_2 + 1 ) ]
      var_6 = 0
      for var_7 in range ( 1 , var_2 + 1 ) :
          for var_8 in range ( 1 , var_3 + 1 ) :
              if var_0 [ var_7 - 1 ] == var_1 [ var_8 - 1 ] :
                  var_5 [ var_7 ] [ var_8 ] = 1 + var_5 [ var_7 - 1 ] [ var_8 - 1 ]
                  var_6 = max ( var_6 , var_5 [ var_7 ] [ var_8 ] )
      return var_6
  