Easy
Smallest Missing Multiple of K — Python
Full explanation · Time O(n) · Space O(n)
# Time: O(n)
# Space: O(n)
# hash table
class Solution(object):
def missingMultiple(self, nums, k):
"""
:type nums: List[int]
:type k: int
:rtype: int
"""
lookup = set(nums)
for i in xrange(1, len(lookup)+1):
if i*k not in lookup:
return i*k
return (len(lookup)+1)*k