【L自o用】

头插

#include<stdio.h>
#include<malloc.h>

typedef struct Node
{
	char data;
	struct Node * next; 
}Node, * LinkList;


LinkList CreateFromHead()
{
	LinkList L;
	Node *p;
	char c;
	L = (LinkList)malloc(sizeof(Node));
	L->next = NULL;
	c = getchar();
	while(c != '\n')
	{
		p = (Node*)malloc(sizeof(Node));
		p->data = c;
		p->next = L->next;
		L->next = p;
		c = getchar();
	}
	return L;
}
void Print(LinkList L)
{
	Node *p;
	for(p = L->next; p != NULL; p = p->next)
	{
		printf("%c", p->data);
	}
}

int main()
{
	LinkList L;
	L = CreateFromHead();
	Print(L);
	return 0;
}

插入节点

#include<stdio.h>
#include<malloc.h>

typedef struct Node
{
	char data;
	struct Node *next;
}Node, *LinkList;

LinkList CreateFromTail()
{
	LinkList L;
	Node *p, *r;
	char c;
	L = (LinkList)malloc(sizeof(Node));
	L->next = NULL;
	r = L;
	c = getchar();
	while(c != '\n')
	{
		p = (Node*)malloc(sizeof(Node));
		p->data = c;
		p->next = NULL;
		r->next = p;
		r = p;
		c = getchar();
	}
	return L;
}
void Print(LinkList L)
{
	Node *p;
	for(p = L->next; p != NULL; p = p->next)
		printf("%c", p->data);
	printf("\n");
}

LinkList InsLinkList(LinkList L, int n, char c)//在第n-1个节点后增加节点
{
	int cnt;
	Node *p, *r;
	p = (Node*)malloc(sizeof(Node));
	p->data = c;
	cnt = 0;
	r = L;
	while(cnt != n - 1 && r->next != NULL)
	{
		r = r->next;
		cnt++;
	}
	if(cnt != n - 1)
	{
		printf("Illegal Insert!\n");
	}
	else
	{
		p->next = r->next;
		r->next = p;
	}
	return L;
}

int main()
{
	LinkList L;
	int n;
	char c;
	L = CreateFromTail();
	Print(L);
	scanf("%d %c", &n, &c);
	L = InsLinkList(L, n, c);
	Print(L);
	return 0;
}

尾插正序输出

#include<stdio.h>
#include<malloc.h>

typedef struct Node
{
	char data;
	struct Node * next;
}Node, *LinkList;

LinkList CreatFromTail()//weicha
{
	LinkList L;
	Node *r, *s;
	char c; 
	L = (Node*)malloc(sizeof(Node));
	L->next = NULL;
	r = L;
	c = getchar();
	while(c != '\n')
	{
		s = (Node*)malloc(sizeof(Node));
		s->data = c;
		r->next = s;
		r = s;
		c = getchar();
	}
	r->next = NULL;
	return L;
}

LinkList paixu(LinkList L)//paixu
{
	char t;
	Node *p, *q; 
	p = (Node*)malloc(sizeof(Node));
	q = (Node*)malloc(sizeof(Node));
	for(p=L;p != NULL; p = p->next)
	{
		for(q = p;q != NULL; q = q->next)
		{
			if(p->data > q->data)
			{
				t = p->data;
				p->data = q->data;
				q->data = t;
			}
		}
	}
	return L;
}
void Print(LinkList L)
{
	Node *p;
	for(p = L; p->next != NULL; p = p->next)
	{
		printf("%c", p->next->data);
		if(p->next->next != NULL)
		{
			printf(" ");
		}
		else
			printf("\n");
	}
}

int main()
{
	LinkList L;
	L = CreatFromTail();
	L = paixu(L);
	Print(L);
	return 0;
}