题目描述
blablabla
样例
import heapq
class Solution(object):
def getUglyNumber(self, n):
"""
:type n: int
:rtype: int
"""
if n <= 0:
return
heap = [1]
visited = set([1])
tmp = None
for i in range(n):
tmp = heapq.heappop(heap)
for multi in [2, 3, 5]:
if tmp * multi not in visited:
visited.add(tmp * multi)
heapq.heappush(heap, tmp * multi)
return tmp