02-线性结构2 Reversing Linked List

 

 

02-线性结构2 Reversing Linked List   (25分)

Given a constant $K$ and a singly linked list $L$, you are supposed to reverse the links of every $K$ elements on $L$. For example, given $L$ being 1→2→3→4→5→6, if $K=3$, then you must output 3→2→1→6→5→4; if $K=4$, you must output 4→3→2→1→5→6.

Input Specification:

Each input file contains one test case. For each case, the first line contains the address of the first node, a positive $N$ (\le 10^5≤10​5​​) which is the total number of nodes, and a positive $K$ ($\le N$) which is the length of the sublist to be reversed. The address of a node is a 5-digit nonnegative integer, and NULL is represented by -1.

Then $N$ lines follow, each describes a node in the format:

Address Data Next

where Address is the position of the node, Data is an integer, and Nextis the position of the next node.

Output Specification:

For each case, output the resulting ordered linked list. Each node occupies a line, and is printed in the same format as in the input.

Sample Input:

00100 6 4
00000 4 99999
00100 1 12309
68237 6 -1
33218 3 00000
99999 5 68237
12309 2 33218

Sample Output:

00000 4 33218
33218 3 12309
12309 2 00100
00100 1 99999
99999 5 68237
68237 6 -1

 

 

 

#include <iostream>
#include <stdio.h>
#define     N   100001
///1310-1436
using namespace std;
struct node
{
    int id;
    int  va;
    int next;
} NODE[N];
void display(int start)
{
    int pt=start;
    while(pt!=-1)
    {
        printf("%05d %d ",pt,NODE[pt].va);
        if (NODE[pt].next!=-1)
        {
            printf("%05d\n",NODE[pt].next);
        }
        else
        {
            printf("-1\n");
        }
        pt=NODE[pt].next;
    }
}
int main()
{
    int start, n,k, i,j,t;
    int pt,pr,nx,ndnum=0,times=0,rePta,rePtb;
    cin>>start>>n>>k;
    for (i=0; i<n; i++)
    {
        cin>>t;
        cin>>NODE[t].va>>NODE[t].next;
    }
    pt=start;
    while(pt!=-1)
    {
        ndnum++;
        pt=NODE[pt].next;
    }
    times=ndnum/k;
    //display(start);
    if (k!=1)
    {
        pr=-1;
        pt=start;

        for (j=1; j<=times*k; j++)
        {
            if (j%k==1)
            {
                rePta=rePtb;
                rePtb=pt;

            }
            else if (j%k==0)
            {
                if (j==k)
                {
                    start=pt;
                }
                else
                {
                    NODE[rePta].next=pt;
                }
            }
            nx=NODE[pt].next;
            NODE[pt].next=pr;
            pr=pt;
            pt=nx;
        }
        NODE[rePtb].next=pt;
    }


    display(start);



    return 0;
}