PTA 链表模拟题

每次做这种链表的模拟题时，总是因为各种bug拿不到满分，所以集中做一波！

L2-002 链表去重 （25 分)

#include <iostream>
#include <stdlib.h>
#include <algorithm>
#include <map>
using namespace std;
const int N = 1e6 + 1;
int e, n, d, a;
struct node {
    int v, net;
} link[N];
struct no {
    int v, add;
} del[N], ans[N];
map<int, int> mp;
int main() {
    cin >> e >> n;
    for(int a, b, c, i = 0; i < n; i++) {
        cin >> a >> b >> c;
        if(link[a].net == 0) {
            link[a].v = b;
            link[a].net = c;
        }
    }
    int s = e;
    while(s != -1) {
        if(!mp[link[s].v]) {
            mp[link[s].v] = 1;
            mp[-link[s].v] = 1;
            ans[a].v = link[s].v;
            ans[a++].add = s;
        } else {
            del[d].v = link[s].v;
            del[d++].add = s;
        }
        s = link[s].net;
    }
    for(int i = 0; i < a - 1; i++) {
        printf("%05d %d %05d\n", ans[i].add, ans[i].v, ans[i + 1].add);
    }
    printf("%05d %d -1\n", ans[a - 1].add, ans[a - 1].v);
    for(int i = 0; i < d - 1; i++) {
        printf("%05d %d %05d\n", del[i].add, del[i].v, del[i + 1].add);
    }
    if(d != 0)
        printf("%05d %d -1\n", del[d - 1].add, del[d - 1].v);
    return 0;
}

L2-022 重排链表 （25 分)

https://pintia.cn/problem-sets/994805046380707840/problems/994805057860517888

#include <bits/stdc++.h>
#include <algorithm>
#define fi first
#define se second
#define INF 0x3f3f3f3f
#define ll long long
#define ld long double
#define mem(ar,num) memset(ar,num,sizeof(ar))
#define me(ar) memset(ar,0,sizeof(ar))
#define lowbit(x) (x&(-x))
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define lcm(a,b) ((a)*(b)/(__gcd((a),(b))))
#define mod 1000000007
#define MP make_pair
#define PI pair<int,int>
using namespace std;
const int N = 1e6 + 10;
int s, n, l = 1, a;
struct nod {
    int add, v;
} li[N], ans[N];
struct node {
    int v, net;
} no[N];
int main() {
    cin >> s >> n;//n不能代表链表长度
    for(int a, i = 0; i < n; i++) {
        cin >> a;
        cin >> no[a].v >> no[a].net;//有重复或无关元素
    }
    int e = s;
    while(e != -1) {
        li[l].add = e;
        li[l++].v = no[e].v;
        e = no[e].net;
    }
    l--;
    if(l % 2 == 0) {
        for(int i = 1; i <= l / 2; i++) {
            ans[a].add = li[l - i + 1].add;
            ans[a++].v = li[l - i + 1].v;
            ans[a].add = li[i].add;
            ans[a++].v = li[i].v;
        }
    } else {
        for(int i = 1; i <= l / 2; i++) {
            ans[a].add = li[l - i + 1].add;
            ans[a++].v = li[l - i + 1].v;
            ans[a].add = li[i].add;
            ans[a++].v = li[i].v;
        }
        ans[a].add = li[l / 2 + 1].add;
        ans[a++].v = li[l / 2 + 1].v;
    }
    for(int i = 0; i < a - 1; i++) {
        printf("%05d %d %05d\n", ans[i].add, ans[i].v, ans[i + 1].add);
    }
    printf("%05d %d -1\n", ans[a - 1].add, ans[a - 1].v);
    return 0;
}