algorithms

Algorithm implementations
git clone git://git.laack.co/algorithms.git
Log | Files | Refs | README

smallest-missing-multiple-of-k-v2.py (280B)

      1 def recurse(itr, k, lookup):
      2     if not (itr * k) in lookup:
      3         return itr * k
      4     return recurse(itr + 1, k, lookup)
      5 
      6 class Solution:
      7 
      8     def missingMultiple(self, nums: List[int], k: int) -> int:
      9         lookup = {num for num in nums}
     10         return recurse(1, k, lookup)