第三周Reverse Integer反转数字

Reverse Integer反转数字

Leetcode algorithms problem 7：Reverse Integer

• 问题描述

  Reverse digits of an integer.
  Example1: x = 123, return 321
  Example2: x = -123, return -321

• 问题提示

  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.
  Note:
  The input is assumed to be a 32-bit signed integer. Your function should return 0 when the reversed integer overflows.

• 思路

  每次乘以10后再从尾取值，再将x自除即可，重点在判断溢出
  将返回值设为long long属性，避免在反转时过大超过int范围而直接变为-2147483647值，导致最后输出为该值。

代码

class Solution {
public:
    int reverse(int x) {
         int a = 0;
         long long result = 0;
         while( x != 0){
            result = result*10 + x % 10;
            x = x/10;
            if( result > 2147483647 || result < -2147483647) {
                 return a;
            }
        }
        return (int) result;
    }
};

时间复杂度: O(logn)
空间复杂度: O(1)

---

疑难

判断是否溢出 的return 语句，一开始直接使用return 0，结果一直在溢出的test通不过，换成return一个值为0的变量就通过了。尚不清楚原因