各函数
2017-09-20 23:26:07 0 举报。。。。
作者其他创作
大纲/内容
游客功能
ch=='#'
是
delete p; return x;
in
否
END
*p=*q;p++; q++;
Start
return i
p=p-rchild;
bt= new BiNode;bt-data=ch;count++; bt-lchild=Creat(bt-lchild); bt-rchild=Creat(bt-rchild);
int i=1;
r[j+d]=r[j];j=j-d;
i=1
return -1;
j++;
end
i=n
top==Size-1
ij
ifstream fin(\"编码文件.txt\"); ofstream out(\"解码文件.txt\");
r[0]r[j]
return 0;
data[++top]=x;size++;
root==NULL
T x;
抛出位置
p!=NULL&&counti-1
Q[++rear]=bt;
q=Q[++front];coutdata\" \";
p=p-next; count++;
int i=0; srand(time(NULL));i=1
文件是否读取完？
top!=-1
exchange!=0
len++;p++;
rear==front
a=='1'
r[i]r[j]
p=p-lchild;
top==-1
cout\"第\"count\"次移动后\"endl; cout\"塔A：\";A.Print(); cout\"塔B：\";B.Print(); cout\"塔C：\";C.Print();
r[0]=r[i];j=i-1;
p-Data==x
r[i]=1+rand()%100;i++
++count&&r[i]!=k
r[j+d]=r[0];i++;
p=front-next; x=p-data; front-next=p-next;
管理功能
ij&&r[i]=r[j]
outdata;
bool isFound = false;char ch;string name=file;count=0; ifstream fin(\"原文件.txt\
*p=='\\0'&&*q=='\\0'
添加图书addbook()
r[0]=r[i];j=i-d;
low=mid+1
return data[top];
r[j+1]=r[j];j--;
i++
r[j+1]=r[0];i++;
p-next==NULL
q-next=NULL;
test[i]-weight+=1;isFound=true;break;
jbound;
Node *newNode;newNode = new Node;newNode-data=ch;newNode-coding=\"\";newNode-weight = 1;test.push_back(newNode);frist.push_back(newNode);
int i=n;r[0]=k
return bt;
Q[++rear]=q-lchild;
开始
kr[mid]
p=new Node; p-Data=a[i]; //给链表的数据域和指针域赋值 q-next=p; q=p;
bt!=NULL
firstend
int index=i;int j=1+1;
Q[++rear]=q-rchild;
s=p-next;x=s-Data;p-next=s-next;delete s；length--;return x;
return 1;
outdata；p=root;
isize
输出data[i]
break;
r[0]=r[i];r[i]=r[index];r[index]=r[0];
*p='\\0';
j++
查找图书findbook()
head-coding=code; return;
p==NULL||p-next==NULL
head-lchild
index=j;
int i=n/2;
int i=d+1;
End
统计排序功能menu_1_2()
test[i]-data==ch
isFound = false;
i test.size();
不断读取a字符
抛出'上溢'
front!=rear
*p!='\\0'
jn
!fin
low=high
q-lchild!=NULL
显示图书show()
int i=0
START
count++; frist_ch+=ch;int i=0;
j=m
return count;
mid=(low+high)/2;count++;
*p*q
int i=0;
r[0]=r[i];r[i]=r[j];r[j]=r[0];i=j;j=2*i;
int j;i=2;
*q!='\\0'
high=mid-1;
return NULL;
r[j]r[index]
r[0]=r[i];r[i]=r[j];r[j]=r[0];i++;
删除图书deletebook()
return 0;
return;
p-data!='*'
;
!isFound
q-rchild!=NULL
d=d/2
index!=i
Star
p++
d=1
p++;q++;
p!=NULL
*p=='\\0'
]
cout\"请输入创建一棵二叉树的结点数据：\"ch;
销售功能sellbook()
head-rchild
j--;
s= new Node; s-Data=x; s-next=p-next;p-next=s;length++;
cout\"error:File open failure!\"endlreturn;
bound=exchange;exchange=0;int j=1;
start
判断密码是否正确
int j;d=n/2;
修改图书changebook()
return mid;
r[j]r[j+1]
char *p=s;int len=0;
a=='0'
char ch;
int i=first;int j=end;
n==1
rear=front
static int count=0;int x=a.Pop();c.Push(x);count++;
r[0]=r[j];r[j]=r[j+1];r[j+1]=r[0];exchange=j;
Node *p=NULL; int x;
*q=='\\0'
int exchange = n;int bound = n;
coutname\" 文件读取成功！\"endl; genHuffTree(test);
r[0]=r[i];r[i]=r[j];r[j]=r[0];j--;
抛出'下溢'
char a;Node*p=root;
jm&&r[j]r[j+1]
抛出\"下溢\"
p==NULL
return 1;
Node *p=first-next;int count=1;
int i=k;int j=2*i;
head==NULL
x=data[top--];size--;return x;
*p!='\\0'&&*q!='\\0'
i--
(head-lchild==NULL)&&(head-rchild==NULL)
return 0
0 条评论
下一页
