链表练习

    终于会写链表了，没想到第一次写就是双向链表，累死累活终于写出来了，新手上路～

移动小球

Problem Description：

有n个小球，标号为1~n，一共有m次指令，对编号的小球进行操作。

Input：

每次输入字母a 数字x 数字y（空格隔开），若a为‘A’，则将编号为x的小球移到编号为y的小球的左边；若a为‘B’，则将编号为x的小球移到编号为y的小球的右边。

Output：

输出最后小球的顺序。

Sample Input：

6 3

A 1 4

B 3 5

A 6 1

Sample Output：

2 6 1 4 5 3

#include<stdio.h>
#include<stdlib.h>
#include<string.h>
struct Link
{
	int num;
	Link *next;
	Link *before;
}*points[100];
void create(int n)
{
	Link *s = points[0];
	for(int i = 1; i <= n + 1; i++)//多加一个球的位置防止链表的NULL影响输出
	{
		s -> next = points[i];
		if(i > 1)
		s -> before = points[i - 2];
		s = s -> next;
		s -> num = i;
	}
	s -> next = NULL;
}
void move(char ch, int a, int b)//避免对具体的球移动，根据相对位置移动
{
	
	if(ch == 'A')
	{
		Link *s1 = points[a], *s2 = points[a];
		s1 = s1 -> before;
		s2 = s2 -> next;
		s1 ->next = s2;
		s2 ->before =s1;
		s1 = points[b], s2 = points[b];
		s1 = s1 ->before;
		s1 ->next = points[a];
		s2 ->before = points[a];
		points[a] ->next = s2;
		points[a] ->before = s1;
	}
	else
	{
		Link *s1 = points[a], *s2 = points[a];
		s1 = s1 -> before;
		s2 = s2 -> next;
		s1 ->next = s2;
		s2 ->before =s1;
		s1 = points[b], s2 = points[b];
		s2 = s2 -> next;
		s1 ->next = points[a];
		s2 ->before = points[a];
		points[a] ->next = s2;
		points[a] ->before = s1;
	}
}
main()
{
	for(int i = 0; i < 100; i++)
		points[i] = (Link*)malloc(sizeof(Link));
	int n, m;
	scanf("%d %d", &n, &m);
	getchar();
	create(n);
	int a, b;
	char ch;
	while(m--)
	{
		scanf("%c %d %d", &ch, &a, &b);
		getchar();
		move(ch, a, b);
	}
	Link *s = points[0];
	for(int i = 0; i < n; i++)
	{
		s = s -> next;
		printf("%d", s ->num);
		if(i != n - 1)
			printf(" ");
	}
	printf("\n");
	free(s);//别忘了释放内存
	for(int i = 0; i < 100; i++)
		free(points[i]);
}