Description
Write a program to find the n-th ugly number.
Ugly numbers are positive integers which are divisible by a or b or c.
Example 1:
Input: n = 3, a = 2, b = 3, c = 5
Output: 4
Explanation: The ugly numbers are 2, 3, 4, 5, 6, 8, 9, 10... The 3rd is 4.
Example 2:
Input: n = 4, a = 2, b = 3, c = 4
Output: 6
Explanation: The ugly numbers are 2, 3, 4, 6, 8, 9, 10, 12... The 4th is 6.
Example 3:
Input: n = 5, a = 2, b = 11, c = 13
Output: 10
Explanation: The ugly numbers are 2, 4, 6, 8, 10, 11, 12, 13... The 5th is 10.
Example 4:
Input: n = 1000000000, a = 2, b = 217983653, c = 336916467
Output: 1999999984
Constraints:
- 1 <= n, a, b, c <= 10^9
- 1 <= a * b * c <= 10^18
- It’s guaranteed that the result will be in range [1, 2 * 10^9]
分析
题目的意思是:给定a,b,c和n,找到第n个ugly数,ugly的数必须被a或b或c中的一个数整除。这道题我参考了一下别人的实现,首先要把ab,bc,abc,a,b,c计算出来,然后给定一个数num,可以用数学的方法计算出它是第k个ugly数,即代码中的count函数。如果知道了这个,剩下的就用二分法找到第n个数了哈,注意我在求lcm4的时候是ab和bc来求,这也是为了应对一个a,b,c为相同数的情况,不然ac不了哈哈。
代码
class Solution:
def lcm(self,a,b):
return a*b//math.gcd(a,b)
def count(self,x,a,b,c,lcm1,lcm2,lcm3,lcm4):
return x//a+x//b+x//c-x//lcm1-x//lcm2-x//lcm3+x//lcm4
def nthUglyNumber(self, n: int, a: int, b: int, c: int) -> int:
l=0
h=2*10**9
lcm1=self.lcm(a,b)
lcm2=self.lcm(b,c)
lcm3=self.lcm(a,c)
lcm4=self.lcm(lcm1,lcm2)
while(l<h):
mid=l+(h-l)//2
if(self.count(mid,a,b,c,lcm1,lcm2,lcm3,lcm4)>=n):
h=mid
else:
l=mid+1
return l