数据结构中利用栈将10进制转换为2、8、16进制

#include

typedefstructtagSTACK {

STACK s;

void push(inti) { }

int pop() { }

void Bin(inti, intk, charstr[]) {

int j, ret; while (i) { }

for (j = 0; ret = pop(), ret != -1; ++j) {

if (ret > 9) { } else {

str[j] = ret + 'A' - 10; push(i % k); i /= k; int ret; if (s.top> -1) { }

return -1;

ret = s.stack[s.top]; s.top--; return ret; s.top++;

s.stack[s.top] = i; int stack[255]; int top;

}STACK;

}

}

}

str[j] = ret + '0';

str[j] = 0;

int main(void) { }

inti; int j;

char result[255]; s.top = -1;

printf(\); scanf(\, &i); getchar();

printf(\); scanf(\, &j); getchar(); switch (j) { case 2: } return 0;

Bin(i, 2, result);

printf(\二进制:\\t\\t%s\\n\, result); s.top = -1; break; s.top = -1; Bin(i, 8, result);

printf(\八进制:\\t\\t%s\\n\, result); break; s.top = -1;

Bin(i, 16, result);

printf(\十六进制:\\t%s\\n\, result); break;

case 8:

case 16: