剑指offer-丑数

class Solution {
public:
    int GetUglyNumber_Solution(int index) {
        if(index<7) return index;
        vector<int> arr;
        int nowmin = 1;
        arr.push_back(nowmin);
        int p2 = 0;
        int p3 = 0;
        int p5 = 0;
        while(arr.size()<index)
        {
            nowmin = min(arr[p2]*2, min(arr[p3]*3, arr[p5]*5));
            if(nowmin==arr[p2]*2) p2++;
            if(nowmin==arr[p3]*3) p3++;
            if(nowmin==arr[p5]*5) p5++;
            arr.push_back(nowmin);
        }
        return nowmin;
        
    }
};