线性表

//本程序的链表带头节点
#include "common.h"


void creat_clist(clink *head)
{
*head = (clink)malloc(sizeof(clist));
assert(*head);
bzero(*head, sizeof(clist));
(*head)->next = NULL;
}
void clear_clist(clink head)
{
clink p, q = head->next;
while(q)
{
p = q;
q = q->next;
free(p);
p = NULL;
}
head->next = NULL;
}
int empty_clist(clink head)
{
return head->next == NULL ? TRUE : FALSE;
}
int length_clist(clink head)
{
int count = 0;
clink p = head->next;
while(p)
{
count++;
p = p->next;
}
return count;
}
int get_clist(clink head, int i, datatype *ret)
{
int j = 1;
clink p = head;
if(i < 1 || i > length_clist(head))
{
printf("i is wrong!\n");
return FALSE;
}
while(j<=i)
{
p = p->next;
j++;
}
*ret = p->data;
return TRUE;
}


clink get_clist2(clink head, int i)//返回被查找节点的地址
{
int j = 1;
clink p = head;
if(i < 1 || i > length_clist(head))
{
printf("i is wrong!\n");
return NULL;
}
while(j<=i)
{
p = p->next;
j++;
}
return p;
}


int locate_clist(clink head, datatype x)
{
int j;
clink p = head->next;
if(empty_clist(head))
{
printf("clist is empty!\n");
return -1;
}
for(j=1; j<=length_clist(head); j++)
{
if(x == p->data)
return j;
p = p->next;
}
return -1;
}
int insert_clist(clink head, datatype x, int i)//在第i个节点前面插入元素x
{
int j;
clink p = NULL, q = NULL;
if(i<1 || i > length_clist(head)+1)
{
printf("i is wrong !\n");
return FALSE;
}

q = (clink)malloc(sizeof(clist));
q->data = x;
q->next = NULL;

p = head;
for(j=1; j<i; j++)
{
p = p->next;
}
q->next = p->next;
p->next = q;
return TRUE;
}
int delete_clist(clink head, int i)//删除第i个节点
{
int j=1;
clink p = head, q = NULL;
if(i<1 || i>length_clist(head))
{
printf("i is wrong!\n");
return FALSE;
}
while(j < i)
{
p = p->next;
j++;
}
q = p->next;
p->next = q->next;
free(q);
q = NULL;
return TRUE;
}


void reverse(clink head)//头插法实现单链表的倒置
{
clink p = head->next, q = NULL;
head->next = NULL;
while(p)
{
q = p;
p = p->next;
q->next = head->next;
head->next = q;
}
}


void merge_clist(clink head1, clink head2)//单链表的合并
{
clink p1 = head1->next, p2 = head2->next, r = NULL;
r = head1;
while(p1 && p2)
{
if(p1->data < p2->data)
{
r->next = p1;
r = p1;
p1 = p1->next; 
}
else
{
r->next = p2;
r = p2;
p2 = p2->next;
}
}
if(p1)
p2 = p1;
r->next = p2;
}


void display_clist(clink head)
{
clink p = head->next;
while(p)
{
printf("%d,",p->data);
p = p->next;
}
putchar('\n');
}


void swap_clist_node(clink head, int i, int j)//通过指针交换两个节点i和j
{
clink tmp = NULL, p ,q, tmp1, tmp2;
p = get_clist2(head, i-1);
q = get_clist2(head, j-1);
tmp1 = p->next->next;
tmp2 = q->next->next;

tmp = p->next;
p->next = q->next;
q->next = tmp;

p->next->next = tmp1;
q->next->next = tmp2;

}

//通过数组实现

#include "common.h"


void creat_sqlist(sqlink *sq)
{
*sq = (sqlink)malloc(sizeof(sqlist));
assert(*sq);
bzero(*sq,sizeof(sqlist));
(*sq)->last = 0;
}
void clear_sqlist(sqlink sq)
{
// bzero(sq,sizeof(sqlist));
sq->last = 0;
}
int empty_sqlist(sqlink sq)
{
return sq->last==0 ? TRUE : FALSE;
}
int full_sqlist(sqlink sq)
{
return sq->last == MAXSIZE ? TRUE : FALSE;
}
int length_sqlist(sqlink sq)
{
return sq->last;
}
int get_sqlist(sqlink sq, int i, datatype *ret)//i表示第几个元素，而不是下标
{
if(empty_sqlist(sq))
{
printf("sqlist is empty!\n");
return FALSE;
}
if(i<1 || i>length_sqlist(sq))
{
printf("i is wrong!\n");
return FALSE;
}
*ret = sq->data[i-1];
return TRUE;
}
int locate_sqlist(sqlink sq, datatype x)//返回x在表中的位置,第几个元素
{
int i=1;
if(empty_sqlist(sq))
{
printf("sqlist is empty!\n");
return -1;
}
while(i <= length_sqlist(sq))
{
if(x == sq->data[i-1])
return i;
i++;
}
return -1;
}
int insert_sqlist(sqlink sq, datatype x, int i)//在第i个元素前面插
{
int j;
if(full_sqlist(sq))
{
printf("sqlist is full!\n");
return FALSE;
}
if(i<1 || i>length_sqlist(sq)+1)
{
printf("i is wrong!\n");
return FALSE;
}
for(j = length_sqlist(sq); j >= i; j--)
{
sq->data[j] = sq->data[j-1];
}
sq->data[i-1] = x;
sq->last++;
return TRUE;
}
int delete_sqlist(sqlink sq, int i)
{
int j;
if(i<1 || i > length_sqlist(sq))
{
printf("i is wrong!\n");
return FALSE;
}
for(j=i; j<length_sqlist(sq); j++)
sq->data[j-1] = sq->data[j];
sq->last--;
return TRUE;
}
void display_sqlist(sqlink sq)
{
int i;
for(i=0; i<length_sqlist(sq); i++)
printf("%d,",sq->data[i]);
putchar('\n');
}