超时解法

public class Solution {
public int GetUglyNumber_Solution(int index) {
        int count = 0;
        int num = 0; 
        while (count < index) {
            num++;
            if (isUglyNumber(num)) {
                count++;
            }
        }
        return num;
    }

    public boolean isUglyNumber(int num) {
        if (num < 1) {
            return false;
        }
        while (num % 2 == 0) {
            num = num / 2;
        }

        while (num % 3 == 0) {
            num = num / 3;
        }
        while (num % 2 == 0) {
            num = num / 5;
        }
        return num == 1;
    }     
}