面试题 34: 丑数

一. 题目

我们把只包含因子 2,3和5的数称作丑数.求按从小到大的顺序的第1500个丑数.例如6,8 都是丑数,但14不是,因为它包含因子7.习惯上我们把1看成第一个丑数.

代码请到我的代码库中下载 Point2Offer

二. 代码

public class No34 {

    public static void main(String[] args) {
        test();
    }

    //方法1: 常规方法,对每个数都进行计算
    private static int getUglyNumber(int index) {
        if (index <=0 ) {
            return 0;
        }
        int number = 0;
        int uglyFoundCount = 0;
        while (uglyFoundCount <index) {
            ++ number;
            if (isUgly(number)) {
                ++uglyFoundCount;
            }
        }
        return number;
    }

    //判断是否是丑数
    private static boolean isUgly(int number) {
        while (number % 2 == 0){
            number /= 2;
        }
        while (number % 3 == 0) {
            number /= 3;
        }
        while (number % 5 == 0) {
            number /= 5;
        }
        return (number==1) ? true:false;
    }

    // 方法2: 只计算是丑数,规律查找,排序输出
    private static int getUglyNumber_Solution(int index){
        if (index <= 0) {
            return 0;
        }

        int[] uglyNumbers = new int[index];
        uglyNumbers[0] = 1;
        int nextUglyNumber = 1;

        int pMultiply2Index = 0;
        int pMultiply3Index = 0;
        int pMultiply5Index = 0;

        while (nextUglyNumber < index ){
            int min = Min(uglyNumbers[pMultiply2Index]*2,uglyNumbers[pMultiply3Index]*3,uglyNumbers[pMultiply5Index]*5);
            uglyNumbers[nextUglyNumber] = min;

            while (uglyNumbers[pMultiply2Index]*2 <= uglyNumbers[nextUglyNumber]){
                ++pMultiply2Index;
            }
            while (uglyNumbers[pMultiply3Index]*3 <= uglyNumbers[nextUglyNumber]){
                ++pMultiply3Index;
            }
            while (uglyNumbers[pMultiply5Index]*5 <= uglyNumbers[nextUglyNumber]){
                ++pMultiply5Index;
            }
            ++nextUglyNumber;
        }

        int uglyNumber = uglyNumbers[nextUglyNumber-1];
        return uglyNumber;
    }


    private static int Min(int i, int j, int k) {
        int min = (i<j)?i:j;
        min = (min<k)?min:k;
        return min;
    }

    /*====================测试用例===============*/
    private static void test() {
        System.out.println("方法1: ");
        int result1 = getUglyNumber(150);
        System.out.println(result1);

        System.out.println("方法2: ");
        int result2 = getUglyNumber_Solution(1500);
        System.out.println(result2);
    }

}

---

有不妥当之处,麻烦告知:D