- 博客(7)
- 收藏
- 关注
RSS订阅原创 链队列、循环队列
链队列：代码：#include <stdio.h>#include <malloc.h> typedef struct LinkNode{ int data; LinkNode* next;}*LinkNodePtr; typedef struct LinkQueue{ LinkNodePtr front; LinkNodePtr rear;}*LinkQueuePtr; LinkQueuePtr initQueue(){ LinkQueu
2022-05-17 20:48:23
94
原创 5.12作业 汉诺塔
1、代码/** * Hanoi. */void hanoi(int paraN, char paraSource, char paraDestination, char paraTransit) { if (paraN <= 0) { return; } else { hanoi(paraN - 1, paraSource, paraTransit, paraDestination); printf("%c -> %c \r\n", paraSource, paraDe
2022-05-12 22:30:59
92
原创 5.12作业 递归
1、代码/** * Recursive addition. */int addTo(int paraN) { int tempSum; printf("entering addTo(%d)\r\n", paraN); if (paraN <= 0) { printf(" return 0\r\n"); return 0; } else { tempSum = addTo(paraN - 1) + paraN; printf(" return %d\r\n", temp
2022-05-12 22:21:24
98
原创 2.5多项式加法
1、代码#include<stdio.h>#include<malloc.h> /** *Linked list of integers. The key is data. The key is sorted in non-descending order. */typedef struct LinkNode{ int coefficient; int exponent; struct LinkNode *next;}*LinkList, *NodePtr;
2022-05-06 21:48:50
106
原创 2.4静态链表
1.代码#include <stdio.h>#include <malloc.h>#define DEFAULT_SIZE 6typedef struct StaticLinkedNode{ char data; int next;} *NodePtr;typedef struct StaticLinkedList{ NodePtr nodes; int* used;} *ListPtr;/** * Initialize the list with
2022-05-03 21:09:41
96
原创 2.3 双向链表
1、代码#include <stdio.h>#include <malloc.h>/** * Double linked list of integers. The key is char. */typedef struct DoubleLinkedNode{ char data; struct DoubleLinkedNode *previous; struct DoubleLinkedNode *next;} DLNode, *DLNodePtr;/**
2022-05-03 20:58:34
78
原创 数据结构2.2 单链表
1、代码#include<stdio.h>#include<malloc.h> typedef struct link { int data; struct link* next;}Link,*LinkPtr; LinkPtr AppendNode_tail(LinkPtr head,int data){//tail LinkPtr p = NULL, pr = head; p = (Link*)malloc(sizeof(Link));
2022-04-29 21:32:06
102
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人