![](https://img-blog.csdnimg.cn/20201014180756928.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
数据结构
文章平均质量分 75
ShulamiteWang
我的世界我主宰
展开
-
队列
队列#include #include "sequeue.h"int main() { Pseq_queue male; Pseq_queue female; male = creatr_null_queue(10); female = creatr_null_queue(10); for(int i = 0; i原创 2016-06-12 15:30:57 · 181 阅读 · 0 评论 -
栈的实现
栈的实现 #include #include "seqstack.h"int main(){ char rpn[] = "300 4 2 +*2 /5 -"; printf("%d\n", rpn_evaluation(rpn)); return 0;}--------------------------------------------原创 2016-06-12 15:28:35 · 212 阅读 · 0 评论 -
圆的数据类型
圆的数据类型 #include #include #include "circle.h"int main(){ Pcircle c1; c1 = (Pcircle)malloc(sizeof(struct circle)); c1->x = 0; c1->y = 0; c1->radius = 5.6; print原创 2016-06-12 15:25:44 · 638 阅读 · 0 评论 -
顺序表的实现
顺序表的实现#include #include #include "seqlist.h"int main(){ Pseqlist seq1; seq1 = create_Null_Seqlist(20); if(is_Null_seqlist(seq1)) printf("Empty\n"); //1f(-1 == lo原创 2016-06-12 15:22:24 · 265 阅读 · 0 评论 -
字符串+
字符串 #include #include #include "seqstring.h"int main(){ char str_target[] = "aabcbabcaabcaababc"; char str_pattern[] = "abcaababc"; int next[] ={-1,0,0,-1,1,0,2,0,0};原创 2016-06-12 15:18:50 · 216 阅读 · 0 评论 -
与瑟夫环
#include #include #include "josephus.h"int main(){ int jose[] = {1,2,3,4,5,6,7,8}; Clinklist cycle = create_array_clink(jose, 8); print_clink(cycle); josephus(cycle, 1, 1);原创 2016-06-12 15:16:32 · 394 阅读 · 0 评论 -
单链表
单链表+++++++++++++++#include #include #include "linklist.h"int main(){ Linklist link1; link1 = create_null_link(); if(is_null_link(link1)) printf("Empty\n"); for(i原创 2016-06-12 15:13:06 · 168 阅读 · 0 评论 -
顺序表
线性表 #include #include "seqlist.h"int main(){ Pseqlist seq1; seq1 = create_null_seqlist(20); for(int i = 0; i seq1->element[i] = i + 1; seq1->n++; }原创 2016-06-12 15:07:18 · 223 阅读 · 0 评论 -
排序
排序 #include #include "sort.h"int main(){ struct recordnode sort_array[]={{49},{38},{65},{97},{76},{13},{27},{49}}; Psortobject psb = create_sortobject(sort_array, 8); struct r原创 2016-06-12 15:34:06 · 164 阅读 · 0 评论