Pseqstack init_seqstack(void) {
Pseqstack S;
S=(Pseqstack)malloc(sizeof(seqstack)); if(S) S->top=-1; return S; }//初始化栈
int empty_seqstack(Pseqstack S) {
if(S->top==-1) return 1; else return 0;
}//判断栈是否为空
int push_seqstack(Pseqstack S,int x) {
if(S->top==maxsize-1) {
printf(\ return 0; } else {
S->top++;
S->data[S->top]=x; return 1; } }//入栈
int pop_seqstack(Pseqstack S,int *x) {
if(empty_seqstack(S)) {
printf(\return 0; } else {
*x=S->data[S->top]; S->top--; return 1; } }//出栈
int destory_seqstack(Pseqstack *S) { if(*S) free(*S); *S=NULL; return 0; }//销毁栈
int conversion(Pseqstack S,int n,int r) { int x; /*if(!r) {
printf(\基数不能为0\ return 0; }*/
S=init_seqstack();
/*if(!S) {
printf(\初始化栈失败\return 0; }*/ while(n) {
push_seqstack(S,n%r); n=n/r; }
while(!empty_seqstack(S)) {
pop_seqstack(S,&x); printf(\}
destory_seqstack(&S); return 0; }//整数部分转换
Pseqqueue init_seqqueue(void) {
Pseqqueue Q;
Q=(Pseqqueue)malloc(sizeof(seqqueue)); if(Q) {
Q->front=0; Q->rear=0; }
return Q; }//初始化队列
int empty_seqqueue(Pseqqueue Q)
{
if(Q&&Q->rear==Q->front) return 1; else return 0;
}//判断队是否为空
int in_seqqueue(Pseqqueue Q,int x) {
if((Q->rear+1)%maxsize==Q->front) {
printf(\队满\return -1; } else {
Q->rear=(Q->rear+1)%maxsize; Q->data[Q->rear]=x; return 0; } }//入队
int out_seqqueue(Pseqqueue Q,int *x) {
if(empty_seqqueue(Q)) {
printf(\队空\return 0; } else {
Q->front=(Q->front+1)%maxsize;
*x=Q->data[Q->front]; return 1; } }//出队
void destory_seqqueue(Pseqqueue *Q) { if(*Q) free(*Q); *Q=NULL; }//销毁队列
int translate(Pseqqueue Q,float a,int b) { int x; /*if(!b) {
printf(\基数不能为0\return 0; }*/
Q=init_seqqueue(); /*if(Q) {
printf(\队列初始化失败\return -1; }*/ while(a) {
in_seqqueue(Q,int(a*b)); a=a*b-int(a*b); }
while(!empty_seqqueue(Q))