1.单链表实现约瑟夫环
2.逆置/反转单链表
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.单链表排序(快速排序)
5.合并两个有序链表,合并后依然有序
6.查找单链表的中间节点,要求只能遍历一次链表
7.查找单链表的倒数第k个节点,要求只能遍历一次链表