閑來(lái)沒事寫著玩。。。。

#include <stdio.h>
#include <stdlib.h>

#define STACK_INIT_SIZE 10
#define STACKINCRMENT 2
#define JINZHI 8????????? //可以修改，以實(shí)現(xiàn)不同進(jìn)制的轉(zhuǎn)換

struct stack
{
??? int *base;
??? int *top;
??? int stacksize;
};

int initstack(struct stack &S);
int push(struct stack &s, int x);
int pop(struct stack &S);
int empty(struct stack &S);

int main()
{
??? struct stack S;
??? long N;

??? printf("創(chuàng)建棧:\n");
??? if (!initstack(S))
??? {
??? ??? printf("創(chuàng)建成功!\n");
??? }
???
??? printf("請(qǐng)輸入N:");
??? scanf("%d", &N);
??? printf("10進(jìn)制數(shù)%d轉(zhuǎn)換%d進(jìn)制的結(jié)果為:", N, JINZHI);

??? while(N)
??? {
??? ??? push(S, N%JINZHI);
??? ??? N /= JINZHI;
??? }
???
??? while(!empty(S))
??? {
??? ??? printf("%d",pop(S));
??? ???
??? }
??? printf("\n\n");
??? return 0;
}

int initstack(struct stack &S)
{
??? S.base = (int *)malloc(sizeof(int) * STACK_INIT_SIZE);
??? if(S.base == NULL)
??? {
??? ??? printf("malloc failed!\n");
??? ??? exit(1);
??? }
??? S.top = S.base;
??? S.stacksize = STACK_INIT_SIZE;
??? return 0;
}

int push(struct stack &S, int x)
{
??? if (S.top - S.base >= S.stacksize)
??? {
??? ??? S.base = (int *)malloc(sizeof(int) * (STACKINCRMENT + S.stacksize));

??? ??? if(!S.base)
??? ??? {
??? ??? ??? printf("malloc failed!\n");
??? ??? ??? exit(1);
??? ??? }
??? ??? S.top = S.base + S.stacksize;
??? ??? S.stacksize += STACKINCRMENT;
??? }
??? S.top++;
??? *S.top= x;
??? return 0;
}

int pop(struct stack &S)
{
??? int x;
??? if (S.top == S.base)
??? {
??? ??? printf("empty stack");
??? ??? exit(1);
??? }
??? x = *S.top;
??? S.top--;
??? return x;
}

int empty(struct stack &S)
{
??? if (S.top == S.base)
??? {
??? ??? return 1;
??? }
??? else
??? {
??? ??? return 0;
??? }
}

轉(zhuǎn)載于:https://blog.51cto.com/qq164587043/78816

總結(jié)

以上是生活随笔為你收集整理的进制转换的实现的全部?jī)?nèi)容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯(cuò)，歡迎將生活随笔推薦給好友。