【面试题】判断回文数-两种方法实现

#include <iostream>
using namespace std;
//总结今天的面试题，就是看一个正整数是不是回文数
//方法1，将数字翻转，如果和原来的数字相同，则是回文数
bool HuiWen(int num)
{
	if(num < 0)
	{
		return 0;
	}
	int origin = num;
	int n = 0;
	while(num > 0)
	{
		n = n*10 + num%10;
		num = num / 10;
	}
	return (n == origin);
}
//方法2：转成字符串形式
bool HuiWen_bxy(int num)
{
	if(num < 0)
	{
		return 0;
	}
	char *str = new char;
	itoa(num,str,10);
	size_t length = strlen(str);
    size_t half_length = length / 2;
    for (int i = 0; i < half_length + 1; ++i)
    {
        if (str[i] != str[length - i - 1])
        {
            return 0;
        }
    }
	return 1;
}

void main()
{
	int a = 123321;
	int b = 12321;
	int c = 123412;
	cout << HuiWen_bxy(a) <<endl;
	cout << HuiWen_bxy(b) <<endl;
	cout << HuiWen_bxy(c) <<endl;
}