单链表的一些操作

1，单链表的排序、

思路描述：

使用插入排序的思路，左端保存一个有序的区间：head-pmax，右端第一个元素为work = pmax->next; 

每次从右端取一个元素，插入左端有序列表中，三种情况：比head中数据小，比head数据大比pmax数据小，比pmax数据大。

初试状态为pmax = head.

代码如下：

#include <stdio.h> #include <stdlib.h> typedef int type; typedef struct Node { type data; Node* next; }Node; void CreateList(Node** head, type buf[], int size) { Node* p(0); Node* q(0); for (int i=0; i<size; i++) { p = (Node*)malloc(sizeof(Node)); p->data = buf[i]; p->next = NULL; if (0==i) { *head = p; q = *head; } else q->next = p; q = p; } } Node* InsertSort(Node*& head) { Node* pmax = head; //第一次指向第二个元素 Node* work = head->next; while(work) { // 将work插入到head位置 if (work->data < head->data) { pmax->next = work->next; work->next = head; head = work; } // 将数据插入到中间 else if (work->data > head->data && work->data < pmax->data ) { Node* bg = head; Node* pre = NULL; while(bg && bg->data < work->data) { pre = bg; bg = bg->next; } pmax->next = work->next; work->next = bg; pre->next = work; } else pmax = work; //直接前移 work = pmax->next; } return head; } void DestroyList(Node* head) { Node* bg = head; while(bg) { Node* p = bg; bg = bg->next; free(p); p = NULL; } } void PrintList(Node* head) { Node* bg = head; while(bg) { printf("%3d ", bg->data); bg = bg->next; } printf("/n"); } int main() { Node* head; int buf[6] = {4, 2, 1, 3, 5, 0}; CreateList(&head, buf, sizeof(buf)/sizeof(buf[0])); InsertSort(head); PrintList(head); DestroyList(head); getchar(); return 0; } 

 

2，单链表单词，计数：

http://topic.csdn.net/u/20110622/21/8c01c738-3c89-41b8-a23d-ca5dc3a0a137.html?17938