#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#define TRUE 1
#define FALSE 0
#define OK 1
#define ERROR 0
#define INFEASIBLE -1
#define OVERFLOW -2
#define MAX 1000
#define E 10
#define FootLoc(p) p+p->size-1
typedef int Status;
typedef int ElemType;
typedef struct WORD //WORD:内存字类型
{
union{
struct WORD *llink; //头部域,指向前驱结点
struct WORD *uplink; //底部域,指向本结点头部
};
int tag;
【数据结构】算法8.1 边界标识法-分配
最新推荐文章于 2022-03-24 21:27:12 发布