- 博客(6)
- 收藏
- 关注
原创 排序
#ifndef _SORT_H_#define _SORT_H_//print methodvoid PrintArray(int *arr, int len){ for (int i = 0; i { printf("%d ", arr[i]); } printf("\n");}//put the larger one to bottom
2015-12-25 14:31:09 173
原创 字符串的操作
#pragma once#define _STRING_H_#include#includeusing namespace std;#define Maxsize 255typedef struct{ char *ch;}sstring;void InitString(sstring *s){ s->ch = (char *)malloc(s
2015-12-25 14:26:40 234
原创 堆栈的实现
#pragma once#include#includeusing namespace std;typedef int ElemType;#define Maxsize 10typedef struct{ ElemType *elem; int top; int len;}stack;//初始化bool InitStack(stack *
2015-12-25 14:19:36 198
原创 队列的实现
#pragma once#define _SQUENCE_H_#include#include#define Maxsize 10using namespace std;typedef int ElemType;typedef struct{ ElemType *elem; int head; int rear; int len;}seq
2015-12-25 14:16:05 190
原创 双向链表
#pragma once#define _DLINKLIST_H_#include#include//双向链表using namespace std;typedef int ElemType;typedef struct Node{ Node *prior; Node *next; ElemType data;}Dlink;//初始化
2015-12-25 14:10:27 133
原创 单链表的实现
#ifndef _LINKLIST_H_#define _LINKLIST_H_#include#include//单链表using namespace std;typedef int ElemType;typedef struct Node{ Node *next; ElemType data;}Link;//初始化void I
2015-12-25 14:01:44 164
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人