首页 > 其他 > 详细

Ugly Number II

时间:2016-10-24 09:29:45      阅读:193      评论:0      收藏:0      [点我收藏+]

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.

 

3 pointer index2, index3, index5

public class Solution {
    public int nthUglyNumber(int n) {
        int isUglyNum[] = new int[n];
        isUglyNum[0] = 1;
        int count = 1;
        int index2 = 0;
        int index3 = 0;
        int index5 = 0;
        while(count < n){
            isUglyNum[count] = Math.min(isUglyNum[index2] * 2, Math.min(isUglyNum[index3] * 3, isUglyNum[index5] * 5));
            if(isUglyNum[count] == isUglyNum[index2] * 2)
                index2 ++;
            if(isUglyNum[count] == isUglyNum[index3] * 3)
                index3 ++;
            if(isUglyNum[count] == isUglyNum[index5] * 5)
                index5 ++;
            count++;
        }
        return isUglyNum[n-1];
    }
    
}

 

Ugly Number II

原文:http://www.cnblogs.com/joannacode/p/5991684.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!