iorangelove-CSDN博客

原创 web bookmark

web bookmark https://cloud.tencent.com/developer/article/1851823

2024-04-24 14:07:41 379

原创栈-括号匹配

includeincludedefine OVERFLOW -1define OK 1define ERROR 0define STACK_INIT_SIZE 100define STACKINCREMENT 10includeinclude include include include define SIZE 100typedef struct{ int age; char

2015-03-25 22:42:25 242

原创循环队列-顺序表

includeincludedefine MAXSIZE 100typedef struct { int *base; int front; int rear; }SqQueue;//初始化队列 int InitQueue(SqQueue *Q) { Q->base=(int *)malloc(MAXSIZE*sizeof(int)); if

2015-03-25 22:41:12 361

原创循环队列-链表实现

#include #include typedef struct QNode { int data; struct QNode *next; }QNode,*QueuePtr; typedef struct { QueuePtr front; QueuePtr rear; }LinkQueue; //

2014-05-16 23:05:23 2912

原创栈的应用数制转换

#include #include #define STACK_INIT_SIZE 100 #define STACK_ADD 10 #define i 2 typedef struct { int *base; int *top; int stacksize; }SqStack; //栈的初始化 int InitStack(SqStac

2014-05-06 11:23:23 422

原创线性表头插法

#include #include typedef struct student { long num; float score; struct student *next; } student; student *create_linklist() { long num; float score; student *head

2014-05-06 11:17:15 899

原创循环队列堆实现

#include #include #define MaxSize 100 typedef int ElemType; typedef struct { ElemType data[MaxSize]; int front; int rear; }CircSeqQueue; //顺序循环队列的初始化 void QueueInitial(CircSeqQueue *

2014-05-06 11:15:17 284

原创矩阵转置的快速转置

#include #include #define OK 1 #define ERROR 0 #define MAXSIZE 100 //最多非0元素的个数 #define MAXR 100 //rpos所能处理的最大行数 #define MAXC 100 //系数矩阵

2014-05-06 11:06:16 942

串的基本算法

串的操作,串的合并，串的复制，串的长度，串的初始化

2014-05-13

空空如也

TA创建的收藏夹 TA关注的收藏夹

TA关注的人