leetcode

Leetcode submissions
git clone git://git.laack.co/leetcode.git
Log | Files | Refs | README

MaxDotProductOfTwoSubsequences.py (399B)

      1 # Call again with subset of set and input is selections
      2 def maxDotProduct(nums: list[int], nums2: list[int]) -> int:
      3     return 1
      4 
      5 
      6 def printResult(expected, actual):
      7     print("EXP: " + str(actual))
      8     print("ACTUAL: " + str(expected))
      9 
     10 
     11 printResult(18, maxDotProduct([2, 1, -1, 5], [3, 0, -6]))
     12 printResult(21, maxDotProduct([3, -2], [2, -6, 7]))
     13 printResult(-1, maxDotProduct([-1, -1], [1, 1]))