zoukankan      html  css  js  c++  java
  • 264. Ugly Number II

    Write a program to find the n-th ugly number.

    Ugly numbers are positive numbers whose prime factors only include 2, 3, 5. For example, 1, 2, 3, 4, 5, 6, 8, 9, 10, 12 is the sequence of the first 10 ugly numbers.

    Note that 1 is typically treated as an ugly number, and n does not exceed 1690.

    The ugly-number sequence is 1, 2, 3, 4, 5, 6, 8, 9, 10, 12, 15, …

    because every number can only be divided by 2, 3, 5, one way to look at the sequence is to split the sequence to three groups as below:

    (1) 2, 2, 2, 2, 2, …
    (2) 3, 3, 3, 3, 3, …
    (3) 5, 5, 5, 5, 5, …
    

    We can find that every subsequence is the ugly-sequence itself (1, 2, 3, 4, 5, …) multiply 2, 3, 5.

    Then we use similar merge method as merge sort, to get every ugly number from the three subsequence.

    Every step we choose the smallest one, and move one step after,including nums with same value.

    Thanks for this author about this brilliant idea. Here is my java solution

    class Solution {
        public int nthUglyNumber(int n) {
            int[] dp = new int[n];
            if (n < 7) {
                return n;
            } 
            int pos2 = 0, pos3 = 0, pos5 = 0;
            int val2 = 2, val3 = 3, val5 = 5;
            dp[0] = 1;
            for (int i = 1; i < n; i++) {
                int min = Math.min(Math.min(val2, val3), val5);
                dp[i] = min;
                if (min == val2) {
                    val2 = 2 * dp[++pos2];
                }
                if (min == val3) {
                    val3 = 3 * dp[++pos3];
                }
                if (min == val5) {
                    val5 = 5 * dp[++pos5];
                }
            }
            return dp[n - 1];
        }
    }
    

      

  • 相关阅读:
    要看的博客
    sleep(0)的妙用
    Spring Cloud:Eureka的多网卡IP选择问题
    SpringBoot整合swagger
    springboot整合redis(注解形式)
    RSA非对称加密
    java split(regex,limit) 使用记录
    windows git支持arc命令
    eclipse安装反编译插件
    使用@Validated分组遇到的坑
  • 原文地址:https://www.cnblogs.com/apanda009/p/7797158.html
Copyright © 2011-2022 走看看