PTA-02-线性结构3 Reversing Linked List

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 (≤10
​5
​​ ) 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 33218

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

#include <stdio.h>
#include <stdlib.h>

struct Node{
	int addr;
	int data;
	struct Node * next;
}; 

typedef struct Node * List;

List initNode()
{
	List p = (List)malloc(sizeof(struct Node));
	
	return p;
}


void print(List l)
{
	l = l->next;
	while(l != NULL)
	{
		if (l->next != NULL)
			printf("%05d %d %05d\n", l->addr, l->data, l->next->addr);
		else
			printf("%05d %d -1", l->addr, l->data);	
			
		l= l->next;
	}
}


List indexList(List l, int n)
{
	int i;
	for (i=0;i<n;i++)
		l=l->next;
		
	return l;
}

void reverseList(List head, int reverseNum, int totalNum)
{
	List l = head;
	int i;
	while(1)
	{
		if (totalNum - i < reverseNum)
			break;
		
		int j;
		
		for (j=2;j<=reverseNum;j++)
		{
			List t = indexList(l, j-1);
			List t2 = t->next;
			
			List temp = l->next;
			l->next = t2;
			t->next = t2->next;
			t2->next =  temp;	
		}
		
		l = indexList(l, reverseNum);
		
		i = i + reverseNum;
	}
}


int main(void)
{
	int firstAddr, totalNum, reverseNum;
	scanf("%d %d %d", &firstAddr, &totalNum, &reverseNum);
	
	int datas[100000], nextAddrs[100000];
	
	List head = initNode();
	List l = head;
	
	int i;
	for (i=0;i<totalNum;i++)
	{
		int addr, data, nextAddr;
		scanf("%d %d %d", &addr, &data, &nextAddr);
		
		datas[addr] = data;
		nextAddrs[addr] = nextAddr;
	}
	
	
	int curAddr = firstAddr;
	for (i=0;i<totalNum;i++)
	{
		l->next = initNode();
		l = l->next; 
		l->addr = curAddr;
		l->data = datas[curAddr];
		
		curAddr = nextAddrs[curAddr];
		
		if (curAddr == -1)
		{
			l->next = NULL;
			break;
		}
	}
	totalNum = i+1;
	
	
	//print(head);
	reverseList(head, reverseNum, totalNum);
	print(head);
	
	return 0;
}