首页 > IT职业 > IT职场 > 具体实现代码@数据结构探险——栈篇 进制转换
#include
#include
#include "MyStack.hpp"
#define BINARY 2
#define OCTAlk 8
#define HEXADECIMAL 16
using namespace std;
int main(void){
char num[] = "0123456789ABCDEF";
MyStack *pStack = new MyStack(30);
int N = 2017;
int remainder = 0;
while(N != 0){
remainder = N % HEXADECIMAL;
pStack->push(remainder);
N = N / HEXADECIMAL;
}
while(!pStack->stackEmpty()){
int elem = 0;
pStack->pop(elem);
cout 来自 “ ITPUB博客 ” ,链接:https://blog.itpub.net/3403/viewspace-2799325/ ,如需转载,请注明出处,否则将追究法律责任。