/********************************************************
* SClist.h頭文件
/********************************************************/
#ifndef __SCLIST_H__
#define __SCLIST_H__
#include<stdio.h>
#include<malloc.h>
#include<assert.h>
typedef int ElemType;
typedef struct Node { //定義結構體
ElemType data;
struct Node *next;
}Node,*PNode;
typedef struct List { //定義頭尾節點及鏈表長度
PNode first;
PNode last;
size_t size;
}List;
void InitSClist(List *list);//初始化循環單鏈表
void push_back(List *list, ElemType x);//在循環單鏈表的末尾插入元素
void push_front(List *list, ElemType x);//在循環單鏈表的頭部插入元素
void show_list(List *list);//打印循環單鏈表
void pop_back(List *list);//刪除循環單鏈表的最后一個元素
void pop_front(List *list);//刪除循環單鏈表的第一個元素
void insert_val(List *list, ElemType val);//將數據元素插入到循環單鏈表中（要求此時循環單鏈表中的數據元素順序排列）
Node* find(List *list, ElemType x);//查找循環單鏈表中數據值為x的結點
int length(List *list);//求循環單鏈表的長度
void delete_val(List *list, ElemType x);//按值刪除循環單鏈表中的某個數據元素
void sort(List *list);//對循環單鏈表進行排序
void reverse(List *list);//逆置循環單鏈表
void clear(List *list);//清除循環單鏈表
void destroy(List *list);//摧毀循環單鏈表
//優化
Node* _buynode(ElemType x);//創建結點
#endif
/********************************************************
* SClist.c文件
/********************************************************/
#include"SClist.h"
/* 創建新節點 */
Node* _buynode(ElemType x) {
Node *s = (Node*)malloc(sizeof(Node));
assert(s != NULL);
s->data = x;
s->next = NULL;
return s;
}
/* 初始化鏈表 */
void InitSClist(List *list) {
Node *s = (Node*)malloc(sizeof(Node));
assert(s != NULL);
list->first = list->last = s;
list->last->next = list->first;//讓鏈表最后一個結點的指針域指向頭結點，從而時鏈表循環
list->size = 0;
}
/* 尾部插入元素 */
void push_back(List *list, ElemType x) {
Node *s = _buynode(x);
list->last->next = s; //尾插
list->last = s; //賦地址
list->last->next = list->first;
list->size++;
}
/* 頭部插入元素 */
void push_front(List *list, ElemType x) {
Node *s = _buynode(x);
s->next = list->first->next; //頭插
list->first->next = s;
if (list->last == list->first)
list->last = s;
list->size++;
}
/* 打印鏈表 */
void show_list(List *list) {
Node *p = list->first->next;
while (p != list->first) {
printf("%d->", p->data);
p = p->next;
}
printf("Nul.\n");
}
/* 尾部釋放一個元素 */
void pop_back(List *list) {
if (list->size == 0)
return;
Node *p = list->first;
while (p->next != list->last)
p = p->next; //找到尾部節點的上一個節點
free(list->last); //釋放尾部元素
list->last = p; //p節點賦給尾部節點
list->last->next = list->first; //再使鏈表指向頭節點
list->size--;
}
/* 從頭釋放一個元素 */
void pop_front(List *list) {
if (list->size == 0)
return;
Node *p = list->first->next;
list->first->next = p->next;
if (list->size == 1) //判斷表中是否只有一個元素
list->last = list->first;
free(p);
list->size--;
}
/* 由小到大插入元素 */
void insert_val(List *list, ElemType x) {
Node *p = list->first;
while (p->next != list->last && p->next->data < x) //輪詢找出大於X的元素並在前面插入
p = p->next;
if (p->next == list->last && p->next->data < x) //只有一個元素
push_back(list, x);
else { //沒有元素
Node *s = _buynode(x);
s->next = p->next;
p->next = s;
list->size++;
}
}
/* 查找鏈表元素 */
Node* find(List *list, ElemType key) {
if (list->size == 0) //鏈表不存在
return NULL;
if (p == list->first) //鏈表為空
return NULL;
Node *p = list->first->next;
while(p != list->first && p->data != key)
p = p->next;
return p;
}
/* 鏈表長度 */
int length(List *list) {
return list->size;
}
/* 刪除鏈表元素 */
void delete_val(List *list, ElemType x) {
if (p == NULL) {
return;
}
if (list->size == 0)
return;
Node *p = find(list, x); //找出元素
if (p == list->last) //p為尾節點
pop_back(list);
else { //p不為尾節點，刪除p
Node *q = p->next;
p->next = q->next;
free(q);
list->size--;
}
}
/* 對循環單鏈表進行排序 */--------------？
void sort(List *list) {
if (list->size == 0 || list->size == 1) //鏈表長度為0或1不排序
return;
Node *s = list->first->next; //第一個元素節點
Node *q = s->next; //第二個元素節點
list->last->next = NULL; //斷開鏈表連接
list->last = s;
list->last->next = list->first;
while (q != NULL) {
s = q;
q = q->next;
Node *p = list->first;
while (p->next != list->last && p->next->data < s->data)
p = p->next;
if (p->next == list->last &&p->next->data < s->data) {
list->last->next = s;
list->last = s;
list->last->next = list->first;
}
else {
s->next = p->next;
p->next = s;
}
}
}
/* 鏈表逆序 */ ---------------->
void reverse(List *list) {
if (list->size == 0 || list->size == 1) //沒有元素或單個元素則忽略
return;
Node *p = list->first->next;
Node *q = p->next;
list->last->next = NULL;
list->last = p;
list->last->next = list->first;
while (q != NULL) {
p = q;
q = q->next;
p->next = list->first->next;
list->first->next = p;
}
}
/* 釋放鏈表所有元素 */
void clear(List *list) {
Node *p = list->first->next;
while (p != list->first) {
list->first->next = p->next;
free(p);
p = list->first->next;
}
list->last = list->first;
list->last->next = list->first;
list->size = 0;
}
/* 摧毀鏈表 */
void destroy(List *list) {
clear(list);
free(list->first);
list->first = list->last = NULL;
}
/********************************************************
* main函數
/********************************************************/
#include"SClist.h"
void main() {
List mylist;
InitSClist(&mylist);
ElemType item;
Node *p = NULL;
int select = 1;
while (select) {
printf("*******************************************\n");
printf("*[1] push_back [2] push_front *\n");
printf("*[3] show_list [4] pop_back *\n");
printf("*[5] pop_front [6] insert_val *\n");
printf("*[7] find [8] length *\n");
printf("*[9] delete_val [10] sort *\n");
printf("*[11] reverse [12] clear *\n");
printf("*[13*] destroy [0] quit_system *\n");
printf("*******************************************\n");
printf("請選擇：>>");
scanf("%d", &select);
if (select == 0) break;
switch (select) {
case 1:
printf("請輸入要插入的數據（-1結束）:>");
while ( scanf("%d", &item) && （ item != -1) ）{
push_back(&mylist, item);
}
break;
case 2:
printf("請輸入要插入的數據（-1結束）:>");
while ( scanf("%d", &item) && （ item != -1) ）{
push_front(&mylist, item);
}
break;
case 3:
show_list(&mylist);
break;
case 4:
pop_back(&mylist);
break;
case 5:
pop_front(&mylist);
break;
case 6:
printf("請輸入要插入的數據:>");
scanf("%d", &item);
insert_val(&mylist, item);
break;
case 7:
printf("請輸入要查找的數據:>");
scanf("%d", &item);
p = find(&mylist, item);
if (p == NULL)
printf("要查找的數據在單鏈表中不存在！\n");
break;
case 8:
printf("單鏈表的長度為%d\n", length(&mylist));
break;
case 9:
printf("請輸入要刪除的值:>");
scanf("%d", &item);
delete_val(&mylist, item);
break;
case 10:
sort(&mylist);
break;
case 11:
reverse(&mylist);
break;
case 12:
clear(&mylist);
break;
//case 13: //推出再釋放
//destroy(&mylist);
//break;
default:
printf("選擇錯誤,請重新選擇！\n");
break;
}
}
destroy(&mylist);
}