当前位置：网站首页>L2-022 rearrange linked list (25 points) linked list operation

L2-022 rearrange linked list (25 points) linked list operation

2022-04-23 00:36:00 【hys__ handsome】

Topic details - L2-022 Rearrange the list (25 branch ) (pintia.cn)

Ideas ： First, generate a linked list through an array , And then through vector Just control the relationship between before and after .

#include<iostream>
#include<cstring>
#include<vector>
using namespace std;
const int N = 100010;
int e[N],ne[N];

int main(){
    int n,h;
    cin>>h>>n;
    memset(ne,-1,sizeof ne);
    for(int i = 0; i < n; i++){
        int a,b,c;
        cin>>a>>b>>c;
        e[a] = b;
        ne[a] = c;
    }
    
    vector<int> ls;
    int t = h;
    while(t != -1){
        ls.push_back(t);
        t = ne[t];
    }
    
    vector<int> res;
    int sz = ls.size();
    for(int i = 0; i < sz/2; i++){
        res.push_back(ls[sz-1-i]);
        res.push_back(ls[i]);
    }
    if(res.size() < sz) res.push_back(ls[sz/2]);
    
    for(int i = 0; i < res.size(); i++){
        printf("%05d %d ",res[i],e[res[i]]);
        if(i != res.size()-1) printf("%05d\n",res[i+1]);
        else puts("-1");
    }
    
    return 0;
}

版权声明
本文为[hys__ handsome]所创，转载请带上原文链接，感谢
https://yzsam.com/2022/04/202204230033479371.html

边栏推荐

猜你喜欢

随机推荐