leetcode---Super Ugly Number
来源:互联网 发布:卡通人物制作的软件 编辑:程序博客网 时间:2024/05/15 08:20
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.
class Solution {public: int nthSuperUglyNumber(int n, vector<int>& primes) { int m = primes.size(); vector<int> dp(n, 1); vector<int> index(m, 0); for(int i=1; i<n; i++) { dp[i] = INT_MAX; for(int j=0; j<m; j++) dp[i] = min(dp[i], dp[index[j]] * primes[j]); for(int j=0; j<m; j++) if(dp[i] == dp[index[j]] * primes[j]) index[j]++; } return dp[n-1]; }};
0 0
- 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
- leetcode - Ugly Number、Ugly Number II 、Super Ugly Number
- leetcode 313 : Super Ugly Number
- [LeetCode 313] Super Ugly Number
- 313. Super Ugly Number LeetCode
- leetcode笔记:Super Ugly Number
- 信用卡校验
- VFS之file描述
- 筋斗云接口编程 / 对象型接口(三)
- Gson存在的问题(更准确地说是它不同的做法)
- 详解shell语法检查模式
- leetcode---Super Ugly Number
- 筋斗云接口编程 / 对象型接口(四)
- java解析获取Excel中的数据--同时兼容2003及2007
- VFS之dentry目录项描述
- Leetcode 128. Longest Consecutive Sequence
- 筋斗云接口编程 / 分页机制
- EventBus 3.0初探: 入门使用及其使用 完全解析
- RecyclerView基本使用用法
- 顶部导航栏可点击可滑动,仿微信仿豆瓣