[Leetcode] #313 Super Ugly Number
来源:互联网 发布:做汉化的软件 编辑:程序博客网 时间:2024/06/06 05:17
Discription:
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.
(4) The nth super ugly number is guaranteed to fit in a 32-bit signed integer.
Solution:
int nthSuperUglyNumber(int n, vector<int>& primes) {vector<int> ugly(n, INT_MAX);ugly[0] = 1;vector<int> index(primes.size(), 0);for (int i = 1; i < n; i++){for (int j = 0; j < primes.size();j++){if (ugly[index[j]] * primes[j] < ugly[i]){ugly[i] = ugly[index[j]] * primes[j];}}for (int j = 0; j < primes.size(); j++){index[j] += (ugly[i] == ugly[index[j]] * primes[j]);}}return ugly[n - 1];}
0 0
- 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
- leetcode---Super Ugly Number
- 计算机图形学里面的实时概念是什么?
- oj3128——递归之放苹果
- The type java.lang.CharSequence cannot be resolved. It is indirectly referenced from required .class
- 软件功能测试
- 逢三退一小程序源码 双向链表实现
- [Leetcode] #313 Super Ugly Number
- PyCharm更换sublime类似主题
- vtkRenderer类的理解以及对该类中函数的解析
- 【LeetCode35】【Search Insert Position】二分法查找
- 使用 EPUB 制作数字图书
- LINUX命令集合
- python-opencv学习笔记
- 为何计算机人应该懂一点编译知识?
- SqlCommand中的常用的方法解析