- 博客(9)
- 收藏
- 关注
RSS订阅原创 递归累加以及汉诺塔
汉诺塔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, paraDestination); han
2022-05-12 16:02:37
109
原创 栈的理解
定义栈typedef struct CharStack { int top; int data[STACK_MAX_SIZE];} *CharStackPtr;打印void outputStack(CharStackPtr paraStack) { for (int i = 0; i <= paraStack->top; i ++) { printf("%c ", paraStack->data[i]); } printf("\r\n");}
2022-05-10 21:10:50
75
原创 括号匹配1
结构体定义typedef struct CharStack { int top; int data[STACK_MAX_SIZE];} *CharStackPtr;栈打印void outputStack(CharStackPtr paraStack) { for (int i = 0; i <= paraStack->top; i ++) { printf("%c ", paraStack->data[i]); } printf("\r\n
2022-05-10 21:06:12
77
原创 多项式求值
定义结构体typedef struct { char S[100]; int top;}CHARStack;void InitStack(CHARStack *S) { S->top = -1;}查看void Push(CHARStack* S, char ch) { if (S->top >= 99) { printf("栈满!\n"); exit(0); } else { S->top++; S->S[S-&
2022-05-10 21:00:21
92
原创 多项式加法
结构体定义typedef struct LinkNode { int coefficient; int exponent; struct LinkNode *next;} *LinkList, *NodePtr;表头LinkList initLinkList() { LinkList tempHeader = (LinkList)malloc(sizeof(struct LinkNode)); //系数 tempHeader->coefficient = 0; /
2022-05-06 16:50:27
126
1
原创 是静态链表
节点typedef struct StaticLinkedNode { char data; int next;} *NodePtr;typedef struct StaticLinkedList { NodePtr nodes; int *used;} *ListPtr;表头ListPtr initLinkedList() { ListPtr tempPtr = (ListPtr)malloc(sizeof(StaticLinkedList)); te
2022-05-03 16:02:47
60
1
原创 是双向链表
结构体定义typedef struct DoubleLinkedNode { char data; struct DoubleLinkedNode *previous; struct DoubleLinkedNode *next;} DLNode, *DLNodePtr;链表创建 DLNodePtr initLinkList() { DLNodePtr tempHeader = (DLNodePtr)malloc(sizeof(struct DoubleLinkedNode))
2022-05-03 15:52:41
89
1
原创 数据结构——链表
代码展示：#include<stdio.h>#include<malloc.h>#define DEFAULT_SIZE 5typedef struct stasticlinkednode{ char data; int next;}*nodeptr;typedef struct stasticlinkedlist{ nodeptr nodes; int* used;}*listptr;listptr initlinkedlist(){ li
2022-04-29 11:43:25
61
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人