leetcode 264. Ugly Number II
来源:互联网 发布:全民奇迹服务端源码 编辑:程序博客网 时间:2024/06/03 08:11
Total Accepted: 56978Total Submissions: 176871Difficulty: MediumContributor: LeetCodeWrite 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.
比较好懂的解法
O(n) Java solutionThe idea of this solution is from this page:http://www.geeksforgeeks.org/ugly-numbers/The ugly-number sequence is 1, 2, 3, 4, 5, 6, 8, 9, 10, 12, 15, …because every number can only be divided by 2, 3, 5, one way to look at the sequence is to split the sequence to three groups as below:(1) 1×2, 2×2, 3×2, 4×2, 5×2, …(2) 1×3, 2×3, 3×3, 4×3, 5×3, …(3) 1×5, 2×5, 3×5, 4×5, 5×5, …We can find that every subsequence is the ugly-sequence itself (1, 2, 3, 4, 5, …) multiply 2, 3, 5.Then we use similar merge method as merge sort, to get every ugly number from the three subsequence.Every step we choose the smallest one, and move one step after,including nums with same value.Thanks for this author about this brilliant idea. Here is my java solutionpublic 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]; }}
阅读全文
0 0
- [leetcode] 264.Ugly Number II
- 264. Ugly Number II LeetCode
- leetcode 264. Ugly Number II
- [leetcode] 264. Ugly Number II
- leetcode.264. Ugly Number II
- LeetCode 264. Ugly Number II
- 【LeetCode】264. Ugly Number II
- LEETCode 264. Ugly Number II
- [Leetcode]264. Ugly Number II
- [leetcode] 264. Ugly Number II
- leetcode 264. Ugly Number II
- LeetCode 264. Ugly Number II
- [LeetCode] 264. Ugly Number II
- Leetcode-264. Ugly Number II
- Leetcode 264. Ugly Number II
- Leetcode 264. Ugly Number II
- [LeetCode]264. Ugly Number II
- leetcode 264. Ugly Number II
- Redis测试分析(pipeline模式推荐)
- Tomcat部署Solr教程
- 开始-运行命令大全
- 单点登录SSO:概述与示例
- 欢迎使用CSDN-markdown编辑器
- leetcode 264. Ugly Number II
- Java序列化与反序列化讲解
- C++ 08 —— Const
- opengles的渲染管线
- 学习Linux命令(21)
- 地图匹配小结
- 《linux命令行与shell脚本编程大全》第三版
- SpringMvc的校验框架
- 2017 计蒜之道 复赛 B. Windows 画图(暴力)