链表题_2

typedef int Data;
typedef struct List
{
Data arrary;
struct List* next;
}List;

List* BuyList(Data x)
{
List* node = (List*)malloc(sizeof(List));
node->next = NULL;
node->arrary = x;
return node;
}

void PushFront(List** pphead,Data x)
{
if ((*pphead) == NULL)
{
*pphead = BuyList(x);
}
else
{
List* start = *pphead;
start = BuyList(x);
start->next = *pphead;
*pphead = start;
}
}

1.单链表实现约瑟夫环

void JosephList(List**pphead)
{
List* end = *pphead;
while (end->next!=NULL)
{
end = end->next;
}
end -> next = *pphead;
}

2.逆置/反转单链表

void Reveaslist_R(List** pphead)
{
List* start = BuyList((*pphead)->arrary);
List* cur = *pphead;
while (cur->next != NULL)
{
cur = cur->next;
PushFront(&start,cur->arrary);
}
*pphead = start;
}

3.单链表排序（冒泡排序）

void BubbleSort(List** pphead)
{
int count = 0;
List* start = NULL;
List* cur = *pphead;
while (cur)
{
count++;
cur = cur->next;
}
while (count > 0)
{
start = *pphead;
while (start->next != NULL)
{
if (start->arrary > start->next->arrary)
{
int tmp = start->arrary;
start->arrary = start->next->arrary;
start->next->arrary = tmp;
}
start = start->next;
}
count--;
start = (*pphead);
}
*pphead = start;
}

4.单链表排序（快速排序）

void SortList(List** pphead)
{
List* first = *pphead;
List* second = NULL;
while (first->next != NULL)
{
second = first->next;
while (second)
{
if (second->arrary < first->arrary)
{
Data tmp = second->arrary;
second->arrary = first->arrary;
first->arrary = tmp;
}
second = second->next;
}
first = first->next;
}
}

5.合并两个有序链表,合并后依然有序

void MergeList(List** pphead, List** pphead1)
{
List* Start = *pphead;
List* cur = Start;
while (Start->next)
{
Start = Start->next;
}
Start->next = *pphead1;
*pphead = cur;
SortList(pphead);
}

6.查找单链表的中间节点，要求只能遍历一次链表

void FindMidfList(List* phead)
{
List* fast = phead;
Data tmp;
List* slow = phead;
while ((fast != NULL) && (fast->next != NULL))
{
tmp = slow->arrary;
slow = slow->next;
fast = fast->next->next;
    }
if (fast == NULL)
{
printf("中间节点所存储的数据为:%d %d\n",tmp,slow->arrary);
}
else if(fast->next == NULL)
{
printf("中间的节点所存储的数据为：%d \n", slow->arrary);
}
}

7.查找单链表的倒数第k个节点，要求只能遍历一次链表

void Find_List(List* phead,Data n)
{
List* fast = phead;
List* slow = phead;
Data a = n - 1;
while (fast->next != NULL)
{
while (a > 0)
{
fast = fast->next;
a--;
}
if (fast->next == NULL)
{
break;
}
slow = slow->next;
fast = fast->next;
}
printf("倒数第%d个节点的数据是：%d \n", n, slow->arrary);
}