十进制转二进制 （栈

C++ Code

#include<stdio.h>
#include<stdlib.h>
#include<malloc.h>
#include<bits/stdc++.h> 
#define MaxStackSize 1000
using namespace std;

typedef struct{
	int stack[MaxStackSize];
	int top;
}SeqStack;

void StackInitiate(SeqStack *S){
}

int StackNotEmpty(){
	
}

int StackPush(SeqStack *S,int *x){
//	把数据元素x压入顺序堆栈S，入栈成功返回1，否则返回0
	if(S->top >= MaxStackSize){
		cout<<"堆栈已满无法插入！\n";
		return 0;
	}else{
		S->stack[S->top] = *x;
		S->top ++; 
		return 1; 
	}
}

int StackPop(SeqStack *S,int *d){
//	弹出顺序栈S的栈顶数据元素到d,出栈成功则返回1，否则返回0
	if(S->top<=0){
		return 0;
	} else{
		S->top--;
		*d = S->stack[S->top];
		return 1;
	}
}

int stackTop(SeqStack *S,int *d){
	if(S->top<=0){
		cout<<"堆栈已空!\n";
		return 0;
	}else{
		*d = S->stack[S->top-1];
		return 1; 
	}
}

// 辗转相除法最后逆序输出 
void toBinary(int s){
	SeqStack *S = (SeqStack*)malloc(sizeof(SeqStack));
	
	int t,i,q;
	
	//入栈
	while(s!=0){
		t = s%2;
		s = s/2;
		i = StackPush(S,&t);
		if(i==0) return;
	} 
	
	while(S){
		if(!StackPop(S,&q)) return;
		cout<<q;
	}
}

int main(){
	SeqStack *myS = (SeqStack*)malloc(sizeof(SeqStack));
	StackInitiate(myS);
	toBinary(123);
	return 0;
}