Super Ugly Number
来源:互联网 发布:股票交易策略 知乎 编辑:程序博客网 时间:2024/04/28 05:43
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.
用一个指针数组来记录每个质数乘积的次数,用另一个数字存储解。
时间复杂度O(nk),空间O(n)+O(k)
class Solution {public: int nthSuperUglyNumber(int n, vector<int>& primes) { int len = primes.size(); vector<int> point(len,0); vector<int> ugly(n,INT_MAX); ugly[0]=1; for(int i=1; i<n; ++i){ for(int j=0; j<len; ++j) ugly[i] = min(ugly[i],ugly[point[j]]*primes[j]); for(int j=0; j<len; ++j) if(ugly[i] == ugly[point[j]]*primes[j]){ ++point[j]; } } return ugly[n-1]; }};
原文出自:http://blog.csdn.net/ciaoliang/article/details/50177735
0 0
- leetcode Super Ugly Number
- Super Ugly Number | LeetCode
- leetcode Super Ugly Number
- Super Ugly Number
- 313Super Ugly Number
- Leetcode200: Super Ugly Number
- leetcode Super Ugly Number
- Leetcode Super Ugly Number
- LeetCode Super Ugly Number
- leetcode - Super Ugly Number
- Super Ugly Number
- 313. Super Ugly Number
- 313. Super Ugly Number
- 313. Super Ugly Number
- 313. Super Ugly Number
- 313. Super Ugly Number
- 313. Super Ugly Number
- 313. Super Ugly Number
- volatile关键字
- Forward Algorithm
- iOS开发之单例,如何正确的创建单例。
- Linux串口编程详解
- 堆和栈的区别
- Super Ugly Number
- 各种刷题网址
- Bitmap的简单保存
- automake manul
- IOS学习开发路线图
- Linux下 tomcat/mysql相关
- uva 1589 xiangqi
- 详细讲述python自省函数getattr的用法
- The request sent by the client was syntactically incorrect ()问题