剑指offer——49

#include <stdio.h>
#include <iostream>
using namespace std;

class Solution {
public:
    int my_min(int x1, int x2) {
        if (x1 < x2) return x1;
        return x2;
    }

    int GetUglyNumber_Solution(int index) {
        int* uglys = new int[100100];
        int ugly_cnt = 0;
        uglys[ugly_cnt++] = 1;
        int index_2 = 0;
        int index_3 = 0;
        int index_5 = 0;

        while (ugly_cnt < index) {
            while (uglys[index_2] * 2 <= *(uglys + ugly_cnt - 1)) {
                index_2++;
            }

            while (uglys[index_3] * 3 <= uglys[ugly_cnt - 1]) {
                index_3++;
            }

            while (uglys[index_5] * 5 <= uglys[ugly_cnt - 1]) {
                index_5++;
            }

            int min_ugly = my_min(uglys[index_2] * 2, my_min(uglys[index_3] *3, uglys[index_5] * 5));
            uglys[ugly_cnt++] = min_ugly;
        }

        printf("%d\n", uglys[ugly_cnt - 1]);

        delete[] uglys;
        return 0;
    }
};

int main() {
    Solution so;
    int n;
    cin >> n;
    so.GetUglyNumber_Solution(n);
    return 0;
}