今天,学到了优先队列,uva136.丑数这个题对着书把代码打了一遍,还是没看懂。
#include <iostream>
#include <vector>
#include <set>
#include <queue>
using namespace std;
typedef long long LL;
const int coeff[3] = {2, 3, 5};
int main()
{
priority_queue<LL, vector<LL>, greater<LL>> pq;
set<LL> s;
pq.push(1);
s.insert(1);
for (int i = 1;; i++)
{
LL x = pq.top();
pq.pop();
if (i == 1500)
{
cout << "The 1500'th ugly number is " << x << ".\n";
;
break;
}
for (int j = 0; j < 3; j++)
{
LL x2 = x * coeff[j];
if (!s.count(x2))
{
s.insert(x2);
pq.push(x2);
}
}
}
return 0;
}
我感觉一次迭代不只生成了一个丑数,就是下面这个循环没看懂
for (int j = 0; j < 3; j++)
{
LL x2 = x * coeff[j];
if (!s.count(x2))
{
s.insert(x2);
pq.push(x2);
}
}