Ugly Number II
来源:互联网 发布:java api 1.8中文在线 编辑:程序博客网 时间:2024/05/29 19:54
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.
public class Solution { public int nthUglyNumber(int n) { int[] ugly = new int[n]; ugly[0] = 1; int index2 = 0, index3 = 0, index5 = 0; int factor2 = 2, factor3 = 3, factor5 = 5; for(int i=1;i<n;i++){ int min = Math.min(Math.min(factor2,factor3),factor5); ugly[i] = min; if(factor2 == min) factor2 = 2*ugly[++index2]; if(factor3 == min) factor3 = 3*ugly[++index3]; if(factor5 == min) factor5 = 5*ugly[++index5]; } return ugly[n-1]; }}
https://leetcode.com/discuss/52716/o-n-java-solution
手写一遍过程
0 0
- Ugly Number Ugly Number II
- Leetcode -- Ugly Number II
- LeetCode: Ugly Number II
- [leetcode] Ugly Number II
- 264 Ugly Number II
- Leetcode: Ugly Number II
- [LeetCode] Ugly Number II
- Ugly Number II
- LeetCode Ugly Number II
- Ugly Number I II
- [leetcode] Ugly Number II
- [LeetCode] Ugly Number II
- LeetCode ||Ugly Number II
- Ugly Number II
- Leetcode: Ugly Number II
- leetcode:ugly Number II
- Ugly Number II
- Ugly Number II
- 树状结构---用jquery的小插件jquery.treeview实现树状结构
- 正则表达式语法
- link rel=canonical 用法
- 压缩JS代码
- 以代码为实例讲解sizeof函数易混淆的用法
- Ugly Number II
- Number of Digit One(数学找规律)
- Linux上快速启动一个HTTP server
- java 单一登录
- JS监听关闭浏览器事件
- [Index]Search in Rotated Sorted Array series
- [Index]ZigZag Conversion
- Android Api Demos登顶之路(七十七)Graphics-->FingerPaint
- LeetCode 题解(224) : Merge Sorted Array