当前位置：网站首页>7-11 重排链表 (25 分)

7-11 重排链表 (25 分)

2022-04-23 03:03:00 【学习kl＆tk】 

#include "bits/stdc++.h"
using namespace std;
const int N = 1e5+5;
vector<int>ans;
deque<int>d;
int head,n,x;
struct node{
    int l,val,r;
}arr[N];
int main()
{
    cin >> head >> n;
    for(int i=0 ;i<n;i++){
        cin >> x;
        cin >> arr[x].val >> arr[x].r;
        arr[x].l = x;
    }
    while (head!=-1){
        d.push_back(arr[head].l);
        head=arr[head].r;
    }
    while (!d.empty()){
        ans.push_back(d.back());
        d.pop_back();
        if(d.empty()) break;
        ans.push_back(d.front());
        d.pop_front();
    }
    int len = ans.size();
    for(int i=0;i<len ; i++){
        if(i == len-1) printf("%05d %d -1\n",ans[i],arr[ans[i]].val);
        else printf("%05d %d %05d\n",ans[i],arr[ans[i]].val,ans[i+1]);
    }


    return 0;
}

版权声明
本文为[学习kl＆tk]所创，转载请带上原文链接，感谢
https://blog.csdn.net/weixin_53013914/article/details/124326124

边栏推荐

猜你喜欢

随机推荐