class Solution:
def GetUglyNumber_Solution(self, index):
# write code here
if (index <= 0):
return 0
uglyList = [1]
i = 0
j = 0
k = 0
for l in range(index-1):
uglydigit = min(uglyList[i]*2,uglyList[j]*3,uglyList[k]*5)
uglyList.append(uglydigit)
if (uglydigit % 2)==0:
i += 1
if (uglydigit % 3)==0:
j += 1
if (uglydigit % 5)==0:
k += 1
return uglyList[-1]
丑数
最新推荐文章于 2024-02-19 21:04:50 发布