递归法实现整型数到字符串的转换

#include <stdio.h>

#define M 6

void intToString(char *p,int origin)
{
static int b=0;
if (origin>10) {

intToString(p,origin/10);

*(p+b)=origin%10+'0';
b ++;
*(p+b)='\0';

}
else {
*(p+b)=origin+'0';
b ++;
*(p+b)='\0';
}

}
int main()
{
char s[M];
int i;
scanf("%d",&i);
if(i>65535||i<-65535)  //
return -1;
intToString(s,i);
printf("\n%s\n",s);
return 0;
}

#include <stdio.h>
#define M 6

void intToString(int num,char *ch)
{
if((num/10) == 0)
{
*ch++ = num+'0';
*ch = '\0';
}
else
{
*ch++ = (num%10)+'0';
intToString(num/10,ch);
}
}
void reverse(char *str)
{
if(str == NULL)
{
return ;
}
char tmp,*pBegin,*pEnd;

pBegin = str;
pEnd   = str;

while(*pEnd != '\0')
{
pEnd ++;
}
pEnd --;

while(pBegin < pEnd)
{
tmp = *pBegin;
*pBegin = *pEnd;
*pEnd  = tmp;

pBegin ++;
pEnd   --;
}
}

int main()
{
char s[M]={0};
int i;
scanf("%d",&i);
if(i>65535||i<-65535)
return -1;
intToString(i,s);
reverse(s);
printf("\n%s\n",s);
return 0;
}

#include <stdio.h>
#define M 6
void reverse(char *str)
{
if(str == NULL)
{
return ;
}
char tmp,*pBegin,*pEnd;

pBegin = str;
pEnd   = str;

while(*pEnd != '\0')
{
pEnd ++;
}
pEnd --;

while(pBegin < pEnd)
{
tmp = *pBegin;
*pBegin = *pEnd;
*pEnd  = tmp;

pBegin ++;
pEnd   --;
}
}
void intToString(int num,char *ch)
{
int tmp = num;
int nCount = 0;
while(tmp != 0)
{
ch[nCount ++] = tmp % 10 + '0';
tmp = tmp / 10;
}
ch[nCount] = '\0';

reverse(ch);
}
int main()
{
char s[M]={0};
int i;
scanf("%d",&i);
if(i>65535||i<-65535)
return -1;
intToString(i,s);
printf("\n%s\n",s);
return 0;
}