题解 | #丑数#

class Solution {
public:
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     * 
     * @param index int整型 
     * @return int整型
     */
    int FindMin(int x, int y, int z)
    {
        return min(x,min(y, z));
    }
    int GetUglyNumber_Solution(int index) {
        if(index==0) return 0;
        vector<int> nums;
        int x=0, y=0, z=0;
        nums.push_back(1);
        int count=1;
        while(index>count)
        {
            nums.push_back(FindMin(nums[x]*2, nums[y]*3, nums[z]*5));
            if(nums[count]==nums[x]*2)
            {
                x++;
            }
            if(nums[count]==nums[y]*3)
            {
                y++;
            }
            if(nums[count]==nums[z]*5)
            {
                z++;
            }
            count++;
        }
        return nums[count-1];
    }
};