迴圈單鏈表

#include #include #include #include #define random(x) rand() % (x)

typedef int status;
typedef int elemtype;
typedef struct lnode
*lnode;
typedef struct linklist
linklist;
int visit(void* data)
status initloopsinglelist(linklist* list);
status createloopsinglelist(linklist* list,int n);
void print(linklist list,int visit());
status looplinklistreverse1(linklist* list);
status bubblesort(linklist* list);
status insert(linklist* list,int i,elemtype e);
status delete(linklist* list,int i,elemtype* e);
int main()
status delete(linklist* list,int i,elemtype* e)
q = p -> next;
*e = q -> data;
p -> next = q -> next;
free(q);
list -> size--;
return 1;
}status insert(linklist* list,int i,elemtype e)
if((pnew = (lnode) malloc (sizeof(lnode))) == 0)
return 0;
pnew -> data = e;
pnew -> next = p -> next;
p -> next = pnew;
list -> size++;
return 1;
}status looplinklistreverse1(linklist* list)
return 1;
}status bubblesort(linklist* list)
q = q -> next;
p = q -> next -> next;
} ptail = q -> next;
} return 1;
}void print(linklist list,int visit())
printf("\n");
}status createloopsinglelist(linklist* list,int n)
p -> next = list -> head;
list -> size += n;
return 1;
}status initloopsinglelist(linklist* list)

迴圈單鏈表

include includetypedef struct node snode snode creat 建立頭結點 t next head 和迴圈雙向鍊錶一樣 在這改就行了 return head int lenth snode l 求鍊錶的長度 return len snode get snod...

迴圈單鏈表

資料結構中迴圈單鏈表的簡單實現以及一些簡單操作的測試。迴圈單鏈表的簡單實現 include include define elemtype char define maxsize 50 using namespace std 定義結構 typedef struct listnode linklist...

迴圈單鏈表

函式宣告部分 cirlinklist.h define crt secure no warnings 1 include includetypedef int elemtype typedef struct linknode node void judgement null node p 判斷動態記...