leetcode-Ugly Number II
来源:互联网 发布:推荐一个好的昵称知乎 编辑:程序博客网 时间:2024/05/16 07:15
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) { if(n<=0) return -1; int array[n]; array[0]=1; int *p2=array; int *p3=array; int *p5=array; int nextindex=1; while(nextindex<n){ array[nextindex]=min(min(*p2*2,*p3*3),*p5*5); while(*p2*2<=array[nextindex]) ++p2; while(*p3*3<=array[nextindex]) ++p3; while(*p5*5<=array[nextindex]) ++p5; ++nextindex; } return array[n-1]; }};
0 0
- Leetcode -- Ugly Number II
- LeetCode: Ugly Number II
- [leetcode] Ugly Number II
- Leetcode: Ugly Number II
- [LeetCode] Ugly Number II
- LeetCode Ugly Number II
- [leetcode] Ugly Number II
- [LeetCode] Ugly Number II
- LeetCode ||Ugly Number II
- Leetcode: Ugly Number II
- leetcode:ugly Number II
- *LeetCode-Ugly Number II
- Ugly Number II -- leetcode
- LeetCode Ugly Number II
- [Leetcode] Ugly Number II
- [Leetcode] Ugly Number II
- leetcode-Ugly Number II
- [LeetCode] Ugly Number II
- leetcode14 Longest Common Prefix
- layer js web弹窗、层
- 关于 “无聊时间” 的随想
- 学习笔记07-设计模式之单例设计模式
- 委托
- leetcode-Ugly Number II
- IP分片和TCP分段的区别
- UVA 1612 Guess
- 实现activity变暗的效果
- c语言 -> 静态数据 动态数据 常量 变量
- 矩形类--RectF
- 程序员书单合集
- string数组相加,去重,且保持顺序不变
- React Reflux