进制转换
链接:栈的实现
demo.cpp
#include "MyStack.h"
/*
进制转换
*/
#define BINARY 2
#define OCTONARY 8
#define HEXADECIMAL 16
int main(void) {
char num[] = "0123456789ABCDEF";
MyStack<int> *pStack = new MyStack<int>(30);
int N = 2019;
int mod = 0;
while (N != 0)
{
mod = N % HEXADECIMAL;
pStack->push(mod);
N /= HEXADECIMAL;
}
//pStack->stackTraverse(false);
int elem = 0;
while (!pStack->stackEmpty())
{
pStack->pop(elem);
cout << num[elem];
}
delete pStack;
pStack = NULL;
system("pause");
}