Â¥Ö÷

[ÇóÖú] ¸÷λ´ó¸ç°ï°ï棬Õâ¸ö³ÌÐòÔõôÐ޸IJÅÄÜÔËÐУ¬Ð»Ð»£¡ typedef int SElemType; #include<string.h> #include<ctype.h> #include<malloc.h> #include<limits.h> #include<stdio.h> #include<stdlib.h> #include<io.h> #include<math.h> #include<process.h> #include<iostream.h> #define STACK_INIT_SIZE 10 #define STACKINCRENENT 2 struct SqStack {SElemType *base; SElemType *top; int stacksize; } Status InitStack(SqStack &S) {if(!(S.base=(SElemType *)malloc(STACK_INIT_SIZE*sizeof(SElemType)))) exit(OVERFLOW); S.top=S.base; s.stacksize=STACK_INIT_SIZE; return OK; } Status DestroyStack(SqStack &S) {free(S.base); S.base=NULL; S.top=NULL; S.stacksize=0; return OK; } Stack ClearStack(SqStack &S) {S.top=S.base; return OK; } Status StackEmpty(SqStack S) {if(S.top==S.base) reurn TRUE; else return FALSE; } int StackLength(SqStack S) {return S.top-S.base; } Status Push(SqStack &S,SElemType e) {if(S.top-S.base>=S.stacksize) {S.base=(SElemType *)realloc(S.base(S.stacksize+STACKINCREMENT)*sizeof(SElumType); if(!S.base) exit(OVERFLOW) S.top=S.base+S.stacksize; S.stacksize+=STACKINREMRNT; } *(S.top)++=e; return Ok; } Status Pop(SqStack &S,SElemType &e) {if(S.top==S.base) return ERROR; e=*--S.top; return OK; } void conversion() {SqStack S; unsigned n; SElemType e; InitStack(S); printf("n(>=0)="); scanf("%u",&n); while(n) {Push(S,n%8); n=n/8; } while(!StackEmpty(S)) {Pop(S,e); printf("%d",e); } printf("\n");    Êղؠ  ·ÖÏí   ¶¥(0)