leetcode.264. Ugly Number II
来源:互联网 发布:手机淘宝为什么登不上 编辑:程序博客网 时间:2024/05/17 02:38
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.
class Solution {public: int nthUglyNumber(int n) { int* arr=(int*)malloc(sizeof(int)*n); int index_2=0,index_3=0,index_5=0; int val_2=2, val_3=3, val_5=5; arr[0]=1; for(int i=1;i<n;i++){ arr[i]=min(min(val_2,val_3),val_5); if(arr[i]==val_2) val_2=arr[++index_2]*2; if(arr[i]==val_3) val_3=arr[++index_3]*3; if(arr[i]==val_5) val_5=arr[++index_5]*5; } return arr[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
- Fragment,FragmentManager, FragmentTransaction详解
- 机型适配的一些小技巧
- Set、List、HashMap优缺点比较,高性能集合
- textarea自动变换高度
- Android AdapterView View的复用机制分析
- leetcode.264. Ugly Number II
- AndroidStudio 断开SVN链接
- 判断自守数
- discuz mobile 接口加载过程
- 23种设计模式(3):抽象工厂模式
- iOS开发系列-动画绘图CALayer
- cocoapods管理私有库
- 函数重载总结
- “秒”转换成“时间”