【LeetCode】 313. Super Ugly Number
来源:互联网 发布:消费品行业 知乎 编辑:程序博客网 时间:2024/04/29 09:50
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.
public class Solution { public int nthSuperUglyNumber(int n, int[] primes) { int[] res = new int[n]; int[] index = new int[primes.length]; int[] value = new int[primes.length]; Arrays.fill(value, 1); int next = 1; for (int i = 0; i < n; i++) { res[i] = next; next = Integer.MAX_VALUE; for (int j = 0; j < primes.length; j++) { if (value[j] == res[i]) { value[j] = res[index[j]++] * primes[j]; } next = Math.min(next, value[j]); } } return res[n - 1]; }}
0 0
- 313. Super Ugly Number LeetCode
- 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] 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 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]313. Super Ugly Number
- leetcode Super Ugly Number
- 解决安卓系统安装的时候出现的不能联网
- SOAP的消息体(一)
- Django之Helloworld
- 李清照
- 疯狼算法日记0003-句子逆序
- 【LeetCode】 313. Super Ugly Number
- 杨辉三角形
- 三国杀
- js清除浏览器缓存的几种方法
- Android应用方法native ida so隐藏及反调试技术浅析
- 进程间通信的方式(二):共享映射区
- Python3.4 写一个简单的定向爬虫
- 20.ArrayAdapter和SimpleAdapter的使用
- 《编码》读书笔记