[剑指offer][面试题34]丑数

#include <iostream>
using namespace std;

int findUglyNum(int iKth)
{
if (iKth<=0){
return -1;
}

int *piNum = new int[iKth];

piNum[0] = 1;
int *piMultipler2 = piNum;
int *piMultipler3 = piNum;
int *piMultipler5 = piNum;

int iIndexNext = 1;
while (iIndexNext<iKth){
int iNumNext = min(*piMultipler2 *2, min(*piMultipler3 *3, *piMultipler5 *5));
piNum[iIndexNext++] = iNumNext;

while (*piMultipler2 * 2 <= iNumNext){
piMultipler2++;
}
while (*piMultipler3 * 3 <= iNumNext){
piMultipler3++;
}
while (*piMultipler5 * 5 <= iNumNext){
piMultipler5++;
}
}

int iUglyNum = piNum[iKth-1];
delete [] piNum;

return iUglyNum;
}

int main()
{
cout<<findUglyNum(1)<<endl;
cout<<findUglyNum(15)<<endl;
}