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
Example 4:
Input: -2147483648
Output: 0
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.
题目要求
给定一个数字,输出倒序数字,要求保留符号,超过 int表示范围输出0。
思路分析
利用除10求余数得到每次末位数字,再不断乘10得到新的数字,同时每次进行数字大小判断,超过int表示范围直接输出0
代码实现
class Solution {
public:
int reverse(int x) {
long ans=0;
int tmp;
int max=INT_MAX;
int min=INT_MIN;
if (x<0)
flag=1;
while(x)
{
tmp=x%10;
ans=ans*10+tmp;
if (ans>max||ans<min)
return 0;
x=x/10;
}
return ans;
}
};
注意:
负数的除10和对10求余数可以保留负号,不用对负号进行判断。