丑数

class Solution {
public:
int GetUglyNumber_Solution(int index) {
if(index==0) return 0;
vector<int> ugly;
ugly.push_back(1);
int uglyindex=1;
int count2=0,count3=0,count5=0;
while(uglyindex<index){
int tmp=min(ugly[count2]*2,ugly[count3]*3);
tmp=min(tmp,ugly[count5]*5);
ugly.push_back(tmp);
uglyindex++;
while(ugly[count2]*2<=tmp)
count2++;
while(ugly[count3]*3<=tmp)
count3++;
while(ugly[count5]*5<=tmp)
count5++;

}
return ugly[uglyindex-1];
}
};