leetcode:数学:Super Ugly Number(313)
来源:互联网 发布:信捷xc3编程软件 编辑:程序博客网 时间:2024/06/03 18:08
Write a program to find the nth super ugly number.
Super ugly numbers are positive numbers whose all prime factors are in the given prime list primes of size k. For example, [1, 2, 4, 7, 8, 13, 14, 16, 19, 26, 28, 32] is the sequence of the first 12 super ugly numbers given primes = [2, 7, 13, 19] of size 4.
Note:
(1) 1 is a super ugly number for any given primes.
(2) The given numbers in primes are in ascending order.
(3) 0 < k ≤ 100, 0 < n ≤ 106, 0 < primes[i] < 1000.
class Solution {public: int nthSuperUglyNumber(int n, vector<int>& primes) { vector<int> res(1, 1), idx(primes.size(), 0); while (res.size() < n) { vector<int> tmp; int mn = INT_MAX; for (int i = 0; i < primes.size(); ++i) { tmp.push_back(res[idx[i]] * primes[i]); } for (int i = 0; i < primes.size(); ++i) { mn = min(mn, tmp[i]); } for (int i = 0; i < primes.size(); ++i) { if (mn == tmp[i]) ++idx[i]; } res.push_back(mn); } return res.back(); }};
0 0
- leetcode:数学:Super Ugly Number(313)
- leetcode 313 : Super Ugly Number
- [LeetCode 313] Super Ugly Number
- LeetCode 313 Super Ugly Number
- LeetCode[313] Super Ugly Number
- [Leetcode] #313 Super Ugly Number
- leetcode Super Ugly Number
- Super Ugly Number | LeetCode
- leetcode Super Ugly Number
- leetcode Super Ugly Number
- Leetcode Super Ugly Number
- LeetCode Super Ugly Number
- leetcode - Super Ugly Number
- 【Leetcode】Super Ugly Number
- leetcode Super Ugly Number
- LeetCode Super Ugly Number
- LeetCode: Super Ugly Number
- Super Ugly Number -- leetcode
- pwnable.kr wp&总结
- Java并发——线程同步volatile与synchronized详解
- 数据操作中涉及到统计的部分主要借助数据库内置函数完成
- 模板模式原理及案例分析
- 【SQLSERVER】获取建表DDL(+主键)
- leetcode:数学:Super Ugly Number(313)
- 不要为了SEO优化而只有SEO优化
- 聊聊高并发系统之HTTP缓存
- Parajumpers Jacka being love people of
- ThinkPHP框架下导出excel数据的方法示例
- angular 组件化
- HDU 4111 Alice and Bob
- Android GirdView/Listview 最后一行显示不完整
- JVM虚拟机工作原理