题目相关
【题目】原题链接
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.
【难度】Easy
Solution
该题目挺简单的,不过需要考虑一些特殊情况,在计算过程中会不会导致溢出,比如如果ret是int 型, ret * 10就可能导致溢出,这里正负情况应该一样的处理情况。如果是负数,先取绝对值,eg: -2147483648,将会导致溢出。
long long ret = 0;
while(x)
{
ret = ret * 10 + x % 10;
x = x / 10;
}
return (ret > INT_MAX || ret < INT_MIN) ? 0: ret;
}
总结
一个题要看完整,比如这次的Note部分没注意到就开始去做题了,后来在一个一个用例的攻击下才进行相应的思考,以及完善代码,后来才注意到这些提示。