SDUT 2054 双向链表

点击打开链接

#include <bits/stdc++.h>
using namespace std;

struct node
{
    int data;
    node *next, *_before;
};

int n, m;
node *head, *tail, *p;
node *creat(int n);
void print(node *head, int m);

int main()
{
    cin >> n >> m;
    head = creat(n);
    while(m --)
    {
        cin >> n;
        print(head, n);
    }
    return 0;
}

node *creat(int n)
{
    head = new node;
    head -> _before = NULL;
    head -> next = NULL;
    tail = head;
    for(int i = 1; i <= n; i++)
    {
        p = new node;
        cin >> p -> data;
        if(i == 1)
        {
            p -> _before = NULL;
        }
        else
        {
            p -> _before = tail;
        }
        tail -> next = p;
        tail = p;
    }
    tail -> next = NULL;
    return head;
}

void print(node *head, int m)
{
    p = head -> next;
    while(p)
    {
        if(p -> data == m)
        {
            if(p -> next && p -> _before)
            {
                cout << p -> _before -> data << ' ' << p -> next -> data << endl;
            }
            else if(p -> next)
            {
                cout << p -> next -> data << endl;
            }
            else if(p -> _before)
            {
                cout << p -> _before -> data << endl;
            }
        }
        p = p -> next;
    }
}