不知道为什么本地运行会卡死,但提交上去可以AC,经过排查问题出在BFS这个函数在本地似乎无法正常返回,有没有大佬帮忙看看。
#include <bits/stdc++.h>
#include <unordered_map>
using namespace std;
const int maxn = 1e3 + 5;
#define lowbit(x) ((x)&(-x))
vector<int> v(maxn),ans;
int n;
struct node
{
node *left, *right;
int num;
node() :left(nullptr), right(nullptr){}
node(int _num) :num(_num){}
};
int count(int no)
{
if (no > n)
return 0;
return count(no * 2) + count(no * 2 + 1) + 1;
}
void creat_tree(node *&t,int low, int high,int no)
{
if (no > n)
return;
int left_num = count(no * 2);
t = new node(v[low+left_num]);
creat_tree(t->left,low, low + left_num - 1, no * 2);
creat_tree(t->right,low + left_num + 1, high, no * 2 + 1);
}
void BFS(node *t)
{
queue<node *> q;
q.push(t);
int cnt = 0;
while (!q.empty())
{
auto top = q.front();
q.pop();
ans.push_back(top->num);
//cnt++;
//cout << top->num;
//if (cnt < n)
//cout << " ";
if (top->left != nullptr)
q.push(top->left);
if (top->right != nullptr)
q.push(top->right);
}
}
int main()
{
cin >> n;
for (int i = 0; i < n; i++)
cin >> v[i];
sort(v.begin(), v.begin()+n);
node *t = nullptr;
creat_tree(t,0, v.size() - 1,1);
BFS(t);
for (int i = 0; i < ans.size(); i++)
{
cout << ans[i];
if (i != ans.size() - 1)
cout << " ";
}
return 0;
}