leetcode uglynumber
来源:互联网 发布:域名注册阿里云 编辑:程序博客网 时间:2024/05/22 06:55
Ugly numbers are positive numbers whose prime factors only include 2, 3, 5
. For example, 6, 8
are ugly while 14
is not ugly since it includes another prime factor 7
.
Note that 1
is typically treated as an ugly number.
如何寻找第n个丑数?
维护2、3、5三个链表作为索引,每次寻找min(result[index2]*2,result[index3]*3,result[index5]*5)
public int nthUglyNumber(int n) { int[] result=new int[n]; result[0]=1; int index2=0,index3=0,index5=0; int count=1; for(int i=1;i<n;i++) { result[i]=min(result[index2]*2,result[index3]*3,result[index5]*5); if(result[i]==result[index2]*2) index2++; if(result[i]==result[index3]*3) index3++; if(result[i]==result[index5]*5) index5++; } return result[n-1];}public int min(int a,int b,int c){ int min=a<b?a:b; return min<c?min:c;}
0 0
- leetcode uglynumber
- LeetCode.263(264) UglyNumber&UglyNumber II
- 题解LeetCode UglyNumber
- UglyNumber
- UglyNumber
- (go语言)263.uglynumber
- leetcode
- [leetcode]
- LeetCode
- leetcode
- leetcode
- leetcode:
- leetcode:
- LeetCode
- leetcode
- LEETCODE
- leetcode
- leetCode
- 【Echarts】——上手Demo
- Struts1.3不支持data-sources数据源配置
- 关于Ubuntu14.04的nfs的使用
- 【GDOI 2016 Day1】中学生数学题
- hibernate_Restrictions用法
- leetcode uglynumber
- Linux基础(一)——文件基本属性
- 高效使用你的Xcode
- BZOJ2851: 极限满月
- 关于std数组和内置数组初始化的疑惑
- 莫比乌斯反演入门
- 关于 ThreadLocal
- leetcode 239. Sliding Window Maximum
- 软件设计七大原则