LeetCode 7 — Reverse Integer(反转整数)

Given a 32-bit signed integer, reverse digits of an integer.

Example 1:
Input: 123
Output: 321
Example 2:
Input: -123
Output: -321
Example 3:
Input: 120
Output: 21
Note:
Assume we are dealing with an environment which could only store integers within the 32-bit signed integer range: [−231, 231 − 1]. For the purpose of this problem, assume that your function returns 0 when the reversed integer overflows.

翻译
给定一个 32 位有符号整数，将整数中的数字进行反转。

示例 1:
输入: 123
输出: 321
示例 2:
输入: -123
输出: -321
示例 3:
输入: 120
输出: 21
注意:
假设我们的环境只能存储 32 位有符号整数，其数值范围是 [−231, 231 − 1]。根据这个假设，如果反转后的整数溢出，则返回 0。

分析
转化为字符串再处理，转化回来时先转化成long long，范围合理再转为int。

c++实现

class Solution {
public:
    int reverse(int x) {
        stringstream ss;
        ss << x;
        string a = ss.str();
        if (a[0] == '-')
        {
            for (int i = 1; i <= (a.length()-1)/2; i++)
            {
                char tmp;
                tmp = a[i];
                a[i] = a[a.length()-i];
                a[a.length()-i] = tmp;
            }
        }
        else
        {
            for (int i = 0; i <= (a.length()-1)/2; i++)
            {
                char tmp;
                tmp = a[i];
                a[i] = a[a.length()-1-i];
                a[a.length()-1-i] = tmp;
            }
        }
        stringstream tt(a);
        long long t;
        tt >> t;
        if (t > pow(2,31)-1 || t < -1*pow(2,31) )
            return 0;
        int result;
        stringstream yy(a);
        yy >> result;
        return result;
    }
};