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.
解法一:
O(n):题目很简单,主要比较麻烦的就是32位整数溢出的判断,一种是用long类型的数保持反转之后的数的结果,再与边界值进行比较,边界值有好几种表示方式,[-231,231-1],用十进制可以表示成[-2147483648,2147483647],也可以用[INT_MIN,INT_MAX]。
class Solution {
public:
int reverse(int x) {
bool minus = false;
if(x < 0)
minus = true;
int absX = abs(x);
int length = 0;
vector<int> res;
while(absX != 0)
{
length++;
res.push_back(absX % 10);
absX /= 10;
}
long ans = 0;
for(int i = 0;i < length;i++)
{
ans += res[i] * pow(10,length - i-1);
}
if(ans < -2147483648 || ans > 2147483647)
return 0;
if(minus)
ans = -ans;
return ans;
}
};
解法二:
提前通过判断溢出来停止循环,从低位开始分解x,每次得计算x%10,然后加上之前得到的计算结果乘10,实现从低位开始不停的往高位扩展,这样每次得到的result都会乘10,所以判断当前的result是否落在[INT_MIN/10,INT_MAX/10]之外来确定是否溢出。
class Solution {
public:
int reverse(int x) {
int result = 0;
while(x)
{
if(INT_MAX/10 < result || INT_MIN/10 > result)
return 0;
result = result*10 + x % 10;
x /= 10;
}
return result;
}
};
解法三:
python解法:python的操作就相对简单,首先判断是否是负数,然后将x的绝对值转化为字符串,利用切片操作,对字符串进行反转,再转化为整型,最后进行32位整型的溢出判断。
class Solution:
def reverse(self, x):
"""
:type x: int
:rtype: int
"""
if(x < 0):
sign = -1
else:
sign = 1
res = sign * int(str(abs(x))[::-1] )
if(-(2**31) < res < (2**31-1)):
return res
else:
return 0
return 0