十进制转化为二进制（栈算法）

输入一个十进制数转化为二进制输出

算法：先将十进制数一直取余，对应的倒序输出则为二进制数，栈的出栈的规则为先进后出，故满足倒序输出

代码：

#include "stdafx.h"

#include<stdlib.h>

#include<malloc.h>



#define STACK_SIZE 100

#define STACKINCREAMENT 10

#define ERROR 0

#define OK 1

#define OVERFLOW -2



typedef int SElemType;

typedef int Status;

typedef int CElemType;



//定义栈结构体

typedef struct Stack{

    SElemType *base;

    SElemType *top;

    int stacksize;

}SqStack;



//函数声明

Status InitStack(SqStack &S);

CElemType Push(SqStack &S, int e);

CElemType PrintfStack(SqStack S);

CElemType PopStack(SqStack &S);

Status StackLength(SqStack S);



int main()

{

    SqStack S;

    InitStack(S);

    int i, e, n, a;

    printf("请输入需要转化的十进制数：");

    scanf_s("%d", &a);

    i = a;

    while (a >= 1)

    {

        e = a % 2;

        Push(S, e);

        a /= 2;

    }

    printf("%d转化为二进制为：", i);

    PrintfStack(S);

}



//构建新的空栈

Status InitStack(SqStack &S)

{

    S.base = (SElemType*)malloc(STACK_SIZE*sizeof(SElemType));

    if (!S.base)

        return ERROR;

    S.top = S.base;

    S.stacksize = STACK_SIZE;

    return OK;

}



//入栈操作

CElemType Push(SqStack &S, int e)

{

    SElemType *p;

    if (S.top - S.base >= S.stacksize)

    {

        S.base = (SElemType*)realloc(S.base, (STACK_SIZE + STACKINCREAMENT)*sizeof(SElemType));

        if (!S.base)

            exit(OVERFLOW);

        p = S.base;

        S.top = S.base + S.stacksize;

        S.stacksize += STACKINCREAMENT;

    }

    *S.top++ = e;

    return OK;

}



//出栈操作

CElemType PopStack(SqStack &S)

{

    if (S.base == S.top)

    {

        printf("The Stack is Empty!!!
");

        return OK;

    }

    printf("出栈的元素为%d
", *(S.top - 1));

    *(--S.top) = NULL;

}