面试题34—丑数

题目：把只包含因子2,3,5的数称为丑数。求第1500个丑数。数字1为第一个丑数。

代码示例：

#include<iostream>
using namespace std;
//丑数：只包含2、3、5的因子。按从小到大的顺序求第1500个丑数。
int Min(int x, int y, int z)
{
	int temp = x < y ? x : y;
	int res = temp < z ? temp : z;
	return res;
}
int UglyNum(int index)
{
	if (index <= 0)
		return -1;
	int *ugly = new int[index];
	ugly[0] = 1;
	int *p2 = ugly;
	int *p3 = ugly;
	int *p5 = ugly;
	int temp = 1;
	while (temp < index)
	{
		int min = Min(*p2 * 2, *p3 * 3, *p5 * 5);
		ugly[temp] = min;
		while (*p2 * 2 <= min)
			p2++;
		while (*p3 * 3 <= min)
			p3++;
		while (*p5 * 5 <= min)
			p5++;
		temp++;
	}
	int res = ugly[index - 1];
	delete ugly;
	return res;
}
int main()
{
	int index = 1500;
	int res = UglyNum(index);
	cout << "第" << index << "个丑数是：" << res << endl;
}