264. Ugly Number II
来源:互联网 发布:福州触动网络 编辑:程序博客网 时间:2024/06/16 00:19
Write a program to find the n
-th ugly number.
Ugly numbers are positive numbers whose prime factors only include 2, 3, 5
. For example, 1, 2, 3, 4, 5, 6, 8, 9, 10, 12
is the sequence of the first 10
ugly numbers.
Note that 1
is typically treated as an ugly number, and n does not exceed 1690.
Hint:
- The naive approach is to call
isUgly
for every number until you reach the nth one. Most numbers are not ugly. Try to focus your effort on generating only the ugly ones. - An ugly number must be multiplied by either 2, 3, or 5 from a smaller ugly number.
- The key is how to maintain the order of the ugly numbers. Try a similar approach of merging from three sorted lists: L1, L2, and L3.
Credits:
Special thanks to @jianchao.li.fighter for adding this problem and creating all test cases.
代码如下:
public class Solution { public int nthUglyNumber(int n) { int[] uglies = new int[n]; int t2 = 0, t3 = 0, t5 = 0; uglies[0] = 1; for (int i = 1; i < n; i ++) { uglies[i] = Math.min(uglies[t2] * 2, Math.min(uglies[t3] * 3, uglies[t5] * 5)); if (uglies[i] == uglies[t2] * 2) t2++; if (uglies[i] == uglies[t3] * 3) t3++; if (uglies[i] == uglies[t5] * 5) t5++; } return uglies[n - 1]; }}
0 0
- 264. Ugly Number II
- 264. Ugly Number II
- 264. Ugly Number II
- 264. Ugly Number II
- 264. Ugly Number II
- 264. Ugly Number II
- 264. Ugly Number II
- 264. Ugly Number II
- 264. Ugly Number II
- 264. Ugly Number II
- 264. Ugly Number II
- 264. Ugly Number II
- 264. Ugly Number II**
- 264. Ugly Number II
- 264. Ugly Number II
- 264. Ugly Number II
- 264. Ugly Number II
- 264. Ugly Number II
- Spring漂流记(一)--Spring概况
- struts2默认Action
- Linux下去掉^M的方法
- glide:源码解析
- 比特币源码学习笔记(二)
- 264. Ugly Number II
- 【CQOI2009】跳舞 网络流
- 后台管理UI的选择
- Android studio学习笔记一
- Cable master
- 树的非递归后续遍历——Java
- 总结Spring中bean的配置方法(Spring实战第4版/2)
- Leetcode:78. Subsets 求集合的子集
- linux — 目录中的权限问题