leetcode:数学:Ugly Number II(264)
来源:互联网 发布:手机淘宝账号怎么激活 编辑:程序博客网 时间:2024/06/04 18:18
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) { vector<int> res(1, 1); int i2 = 0, i3 = 0, i5 = 0; while (res.size() < n) { int m2 = res[i2] * 2, m3 = res[i3] * 3, m5 = res[i5] * 5; int mn = min(m2, min(m3, m5)); if (mn == m2) ++i2; if (mn == m3) ++i3; if (mn == m5) ++i5; res.push_back(mn); } return res.back(); }};
0 0
- leetcode:数学:Ugly Number II(264)
- Leetcode 264 - Ugly Number II(dp)
- 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 -- Ugly Number II
- LeetCode: Ugly Number II
- C++ map笔记-
- 简单几步activity实现ios侧滑删除效果
- 【模拟】NEERC15 A Adjustment Office (Codeforces GYM 100851)
- pixhawk软件分析之代码框架与文件结构
- Client-Server C程序示例C (使用 Sockets 和 TCP)
- leetcode:数学:Ugly Number II(264)
- BZOJ 2157: 旅游
- 《深度探索c++对象模型》读书笔记(一)
- 快速幂取余深度讲解
- 解决ScrollView下嵌套GridView显示不全的问题
- C#使用FastReport 报表初步体验(图文)
- HBase架构精讲
- springMVC提交form表单页面不跳转
- Android开发短视频录制