剑指offer 丑数

#include < vector > class Solution {
    public: int getmin(int a, int b, int c) {
        int smaller = a < b ? a: b;
        return smaller < c ? smaller: c;
    }
    int GetUglyNumber_Solution(int index) {
        if (index == 0) {
            return 0;
        }
        vector < int > numbers;
        int currindex = 0;
        numbers.push_back(1);
        int i2 = 0;
        int i3 = 0;
        int i5 = 0;
        while (currindex < index) {
            int num2 = numbers[i2] * 2;
            int num3 = numbers[i3] * 3;
            int num5 = numbers[i5] * 5;
            int min = getmin(num2, num3, num5);
            numbers.push_back(min);
            if (min == num2) i2++;
            if (min == num3) i3++;
            if (min == num5) i5++;
            currindex++;
        }
        return numbers[index - 1];
    }
};