LeetCode Ugly Number II(丑数的计算)

代码如下：

public class Solution
{public int nthUglyNumber(int n) {int[] primes = {2, 3, 5};int[] idx = new int[primes.length];int[] vals = new int[primes.length];Arrays.fill(vals, 1);int next = 1;int[] ugly = new int[n];for (int i = 0; i < n; i++) {ugly[i] = next;next = Integer.MAX_VALUE;for (int j = 0; j < primes.length; j++) {if (vals[j] == ugly[i]) vals[j] = ugly[idx[j]++] * primes[j];next = Math.min(next, vals[j]);}}return ugly[n - 1];}

LeetCode Ugly Number II(丑数的计算)相关推荐

Leetcode264. Ugly Number II丑数2
编写一个程序,找出第 n 个丑数. 丑数就是只包含质因数 2, 3, 5 的正整数. 示例: 输入: n = 10 输出: 12 解释: 1, 2, 3, 4, 5, 6, 8, 9, 10, 12 ...
[leetcode] Ugly Number II
public class Solution { public int nthUglyNumber(int n) { int[] ugly=new int[n+10]; ...
leetcode 264. Ugly Number II
传送门 264. Ugly Number II QuestionEditorial Solution My Submissions Total Accepted: 36259 Total Submis ...
LeetCode - Medium - 264. Ugly Number II
Topic Math Dynamic Programming Heap Description https://leetcode.com/problems/ugly-number-ii/ Analys ...
[LeetCode]Single Number II
今天室友推荐了一道LeetCode上面的练习题Single Number II,题目大概的意思是有一个整形的数组,里面只有一个数是出现一次的,其他的数都出现了三次,然后让把这个数找出来. 第一眼看到这 ...
Lintcode 4 Ugly Number II
原题如下: Ugly number is a number that only have factors 2, 3 and 5. Design an algorithm to find the nth ...
poj 1338 Ugly Numbers（丑数模拟）
转载请注明出处:http://blog.csdn.net/u012860063? viewmode=contents 题目链接:http://poj.org/problem?id=1338 Descr ...
LeetCode Ugly Number
题意:给出一个数,判断是否是丑数.质因数只包含2,3,5的代码如下: public class Solution {public boolean isUgly(int num){if (num &l ...
Leetcode题库263.丑数(c实现)
文章目录思路代码思路将n的所有质因数2.3.5都除去,若最后n为1,则说明n为丑数,否则n不是丑数代码 bool isUgly(int n){if(n==0) return false;in ...

LeetCode Ugly Number II(丑数的计算)

LeetCode Ugly Number II(丑数的计算)相关推荐

最新文章

热门文章