7. Reverse Integer

Reverse digits of an integer.

Example1: x = 123, return 321
Example2: x = -123, return -321

click to show spoilers.

Have you thought about this?
Here are some good questions to ask before coding. Bonus points for you if you have already thought through this!

If the integer’s last digit is 0, what should the output be? ie, cases such as 10, 100.

Did you notice that the reversed integer might overflow? Assume the input is a 32-bit integer, then the reverse of 1000000003 overflows. How should you handle such cases?

For the purpose of this problem, assume that your function returns 0 when the reversed integer overflows.

分析：考虑溢出的问题；其他的都是利用字符串的特殊操作函数（见面C++primer P328），先将int n 转化为字符串，然后，字符串反转，接着将字符串转化为long long型，（因为如果不这样，直接再转化为int型，则会导致溢出），接着再判断是否溢出：
int的最大值是多少？首先看其占几个字节，如果占4字节，则2的32次方=4294967296（无符号int），带符号再除以2，负数比正数多个，-2147483648~+2147483647

int main()
{
    int n;
    while (cin >> n)
    {
        string s;
        int flag = 0;
        long long tmp;  //作为临时量，接受更大范围的数，从而判断是否溢出
        if (n < 0)flag = 1;  //flag == 1 表示负数
        tmp = n;   
        if (flag == 0)
        {
            s = to_string(tmp); //将值转化为字符串
            reverse(s.begin(), s.end()); //字符串反转
            tmp = stoll(s, 0, 10);  //将字符串以基为10，转化为long long型
            if (tmp > 2147483647)tmp = 0; //判断是否溢出 32位int 表示的数的范围为： -2147483648~2147483647
            n = tmp;
            cout << n << endl;
        }
        else
        {
            s = to_string(tmp*(-1));
            reverse(s.begin(), s.end());
            tmp = stoll(s, 0, 10);
            if (tmp >2147483648)tmp = 0;
            n = tmp *(-1);
            cout << n << endl;
        }
    }
}

注意：提交的时候编译器报错：
Line 13: no matching function for call to ‘Solution::reverse(std::basic_string::iterator, std::basic_string::iterator)’
这个是说，在Solution::的作用域内，没有找到reverse函数名，解决：需要添加std::作用域，在std命名空间进行查找；