整数转换为字符串

非递归：

#include <iostream>
#include <assert.h>
using namespace std;

char *ItoA(int num)
{
    char *str = NULL;
    int len = 0;
    int temp = num;
    while (temp != 0)    //计算整数的长度，以为后面字符串申请空间的长度
    {
        len++;
        temp /= 10;
    }
    str = new char[len+1];
    int number, i = len - 1;
    while (num != 0)
    {
        number = num % 10;
        str[i] = number + '0';
        num /= 10;
        i--;
    }
    str[len] = '\0';
    return str;
}

int main()
{
    char *p;
    p = ItoA(4781256);
    cout<<p<<endl;
    delete []p;

    return 0;
}

递归实现：

void Itoa(int num)
{
    if (num <= 0)
    {
        return;
    }
    else
    {
        char ch;
        ch = num % 10 + 48;
        Itoa(num/10);
        putchar(ch);
    }
}