02-1. 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 (<= 105) which is the total number of nodes, and a positive K (<=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 Next is 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 33218Sample Output:
00000 4 33218 33218 3 12309 12309 2 00100 00100 1 99999 99999 5 6823768237 6 -1
#include<stdio.h> #define MaxLen 100004 typedef struct{ int data; int next; }Node; int main() { Node A[MaxLen]; int findex,N,k,start,B[MaxLen]; int i,sum; int addr,idata,inext; scanf("%d%d%d",&findex,&N,&k); for(i=0;i<N;i++) { scanf("%d%d%d",&addr,&idata,&inext); A[addr].data=idata; A[addr].next=inext; } start=findex; i=0; while(start!=-1) { B[i]=start; start=A[start].next; i++; } sum=i; for(i=0;i<sum/k*k;i++) { if(i%k==0) { if(sum-i<2*k) { A[B[i]].next=A[B[i+k-1]].next; } else { A[B[i]].next=B[i+2*k-1]; } } else { A[B[i]].next=B[i-1]; } } start=B[k-1]; if(sum>1){ for(i=0;i<sum-1;i++) { printf("%.5d %d %.5d\n",start,A[start].data,A[start].next); start=A[start].next; } } printf("%.5d %d %d\n",start,A[start].data,-1); return 0; }