链表
Miracle_QSH
这个作者很懒,什么都没留下…
展开
-
SDUT - 2116 数据结构实验之链表一:顺序建立链表
#include <stdio.h> #include <stdlib.h> struct node { int data; struct node *next; }; int main() { int n; scanf("%d", &n); struct node *h, *p, *q; h = (struct n...原创 2018-08-15 10:24:35 · 322 阅读 · 0 评论 -
SDUT - 3712 插入排序
#include <stdio.h> #include <stdlib.h> struct node { int data; struct node *next; }; int main() { int n, i, m; while(scanf("%d", &n) != EOF) { struct node ...原创 2018-08-15 10:37:31 · 225 阅读 · 0 评论 -
SDUT - 2120 数据结构实验之链表五:单链表的拆分
#include <stdio.h> #include <stdlib.h> struct node { int data; struct node *next; }; int main() { int n, i, num1 = 0, num2 = 0; scanf("%d", &n); struct node *h, *q...原创 2018-08-15 10:36:24 · 261 阅读 · 0 评论 -
SDUT - 2121 数据结构实验之链表六:有序链表的建立
#include <stdio.h> #include <stdlib.h> struct node { int data; struct node *next; }; int main() { int n, i; scanf("%d", &n); struct node *h, *q, *p; h = (struc...原创 2018-08-15 10:31:05 · 238 阅读 · 0 评论 -
SDUT - 2117 数据结构实验之链表二:逆序建立链表
#include <stdio.h> #include <stdlib.h> struct node { int data; struct node *next; }; int main() { int n, i; scanf("%d", &n); struct node *h, *p; h = (struct no...原创 2018-08-15 10:30:15 · 328 阅读 · 0 评论 -
SDUT - 3331 数据结构实验之链表八:Farey序列
#include <stdio.h> #include <stdlib.h> struct node { int a1, a2; struct node *next; }; int main() { int n; scanf("%d", &n); struct node *h, *q, *p; h = (struct...原创 2018-08-15 10:29:23 · 274 阅读 · 0 评论 -
SDUT - 2118 数据结构实验之链表三:链表的逆置
#include <stdio.h> #include <stdlib.h> struct node { int data; struct node *next; }; int main() { int n = 0, i, k; struct node *h, *h1, *q1, *q, *p; h1 = (struct node ...原创 2018-08-15 10:28:30 · 231 阅读 · 0 评论 -
SDUT - 2122 数据结构实验之链表七:单链表中重复元素的删除
#include <stdlib.h> #include <stdio.h> struct node { int data; struct node *next; }; int main() { int n, i; scanf("%d", &n); struct node *h, *p, *q; h = (struc...原创 2018-08-15 10:27:28 · 206 阅读 · 0 评论 -
SDUT - 2119 数据结构实验之链表四:有序链表的归并
#include <stdio.h> #include <stdlib.h> struct node { int data; struct node *next; }; int main() { int n, m, i, j; scanf("%d %d", &n, &m); struct node *h1, *h2,...原创 2018-08-15 10:26:25 · 378 阅读 · 1 评论 -
SDUT - 3535 3n+1数列问题
#include <stdio.h> #include <stdlib.h> struct node { int data; struct node *next; }; int main() { int n, k, i; while(scanf("%d %d", &n, &k) != EOF) { s...原创 2018-08-15 10:25:32 · 149 阅读 · 0 评论 -
SDUt - 2054 数据结构实验之链表九:双向链表
#include <stdio.h> #include <stdlib.h> struct node { int data; struct node *last, *next; }; int main() { int n, i, m, k; scanf("%d %d", &n, &m); struct node *h...原创 2018-08-18 10:14:32 · 352 阅读 · 0 评论