（剑指offer）丑数，只包含因子2、3和5的数称作丑数

最新推荐文章于 2024-06-29 12:15:27 发布

neuHenry

最新推荐文章于 2024-06-29 12:15:27 发布

阅读量1.3k

点赞数

分类专栏：算法

本文链接：https://blog.csdn.net/u010347226/article/details/77931276

版权

算法专栏收录该内容

16 篇文章 0 订阅

订阅专栏

题目：按从小到大的顺序输出前n个丑数，习惯上把1当做第一个丑数；

代码如下：

public class UglyNum {

    public static void main(String[] args) {
        // 要输出的丑数个数
        int des = 1500;
        // 结果数组
        int[] result = new int[des];
        result = GetUglyNumber_Solution(des);
        int count = 0;
        for (int i = 0; i < result.length; i++) {
            System.out.print(result[i] + " ");
            count++;
            if (count % 10 == 0) {
                System.out.println();
            }
        }
    }

    public static int[] GetUglyNumber_Solution(int index) {
        if (index <= 0) {
            return null;
        }
        int[] uglyNum = new int[index];
        uglyNum[0] = 1;
        int nextUglyIdex = 1;

        int multiply2 = 0;
        int multiply3 = 0;
        int multiply5 = 0;

        while (nextUglyIdex < index) {
            int minUgly = Math.min(uglyNum[multiply2] * 2, 
                    Math.min(uglyNum[multiply3] * 3, uglyNum[multiply5] * 5));
            uglyNum[nextUglyIdex] = minUgly;
            while (uglyNum[multiply2] * 2 <= uglyNum[nextUglyIdex]) {
                multiply2++;
            }
            while (uglyNum[multiply3] * 3 <= uglyNum[nextUglyIdex]) {
                multiply3++;
            }
            while (uglyNum[multiply5] * 5 <= uglyNum[nextUglyIdex]) {
                multiply5++;
            }
            nextUglyIdex++;
        }

        return uglyNum;
    }
}