12.8周末总结

1.建立一个单向有序链表，初始包含1 5 7 16输入一个1~20的数，将其插入其中并使链表依然有序
扩展：输入n个数，使其依然有序。

代码：

#include <stdio.h>
#include <malloc.h>
#include <stdlib.h>
#define N 100
typedef struct shu{
 	int data;
 	struct shu*next;
}Shu;
shu*Head;
shu*now;

void create(void)
{
 	Head = (Shu*)malloc(sizeof(shu));
 	Head->next = NULL;
 	now = Head;
}
void init(int e)
{
 	Shu*p = (Shu*)malloc(sizeof(shu));
 	p->data = e;
 	p->next = NULL;
 	now->next = p;
 	now = p;
}
void insert(int index,int e,int n)
{
 	Shu*q = Head;
 	Shu*p = (Shu*)malloc(sizeof(shu));
 	p->data = e;
 	int i;
 	if(index == n)
 	{
  		for(i = 1;i < index;i++)
  		{
   			q = q->next;
  		}
  	q->next = p;
  	p->next = NULL;
 	}
 	else
 	{
  		for(i = 1;i < index;i++)
  		{
   			q = q->next;
  		}
  		p->data = e;
  		p->next = q->next;
  		q->next = p;  
	 }
}
int main(void)
{
 	int a[N] = {0,2,5,8,9};
 	int *w;
 	int i,b,c,n,j,t;
 	printf("请输入创建的数目：\n");
 	scanf("%d",&n);
 	printf("请输入数字：\n"); 
 	for(i = 1;i <= n;i++)
 	{
 		scanf("%d",&a[i]);
 	}
 	for(i = 1;i <= n;i++)
 	{
  		for(j = 1;j < n;j++)
  		{
   			if(a[j] > a[j+1])
   			{
    				t = a[j];
    				a[j] = a[j+1];
    				a[j+1] = t;
   			}
 		}
 	}
 	create();
 	for(i = 1;i <= n;i++)
 	{
  		init(a[i]);
	}
 	printf("请输入一个数：\n");
 	scanf("%d",&b);
 	for(c =1,i = 1;i <= n;i++)
 	{
  		if(b > a[i])
 		c++;
 	}
 	insert(c,b,n);
 	Shu*p = Head->next;
 	printf("插入前：");
 	for(i = 1;i <= n;i++)
 	{
  		printf("%d ",a[i]);
 	}
 	printf("\n"); 
 	printf("插入后：");
 	while(p != NULL)
 	{
  		printf("%d ",p->data);
  		p = p->next;
 	}
 	return 0; 
}

翻转一个链表1->2->3->4->5,使其变为5->4->3->2->1

代码：

#include <stdio.h>
#include <stdlib.h>
typedef struct node{
 	int data;
 	struct node*next;
}Node;
Node*create(void)
{
 	Node*Head;
 	Node*p;
 	int i;
 	Head = (Node*)malloc(sizeof(Node));
 	Head->next = NULL;
 	Head->data = 5;
 	for(i = 4;i >= 1;i--)
 	{
 		p = (Node*)malloc(sizeof(Node));
 		p->data = i;
  		p->next = Head;
  		Head = p;
 	}
 	return Head;
}
Node*flip(Node*Head)
{
 	Node*p = Head;
 	Node*q;
 	while(p->next != NULL)
 	{
  		q = p->next;
  		p->next = q->next;
  		q->next = Head;
  		Head = q; 
 	}
 	return Head;  
}
int main(void)
{
 	Node*Head = create();
 	Node*q = Head;
 	printf("翻转前：");
 	while(q != NULL)
 	{
  		printf("%d ",q->data);
  		q = q->next; 
 	}
 	Node*p = flip(Head);
 	printf("\n");
 	printf("反转后：");
 	while(p != NULL)
 	{
  		printf("%d ",p->data);
  		p = p->next; 
 	}
 	return 0;
}