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.
对于溢出,不知道如何处理。在设计算法的时候,写的不是很流畅,想着怎样把代码写的简明。
处理溢出算法:
int reverse(int x) {
int rev = 0;
while (x != 0) {
int pop = x % 10;
x /= 10;
if (rev > INT_MAX/10 || (rev == INT_MAX / 10 && pop > 7)) return 0;
if (rev < INT_MIN/10 || (rev == INT_MIN / 10 && pop < -8)) return 0;
rev = rev * 10 + pop;
}
return rev;
}
自己的没考虑32位的渣渣代码:
int fun(int sum[],int x)
{
int n = 0, m = 0;
int k = 0;
int i = 0;
while (x > 9 && k < 33) {
n = x % 10;
x = x / 10;
sum[k] = n;
for (int j = 0; j <= k; j++) {
sum[j] *= 10;
}
k++;
}
sum[k] = x;
for (i = 0; sum[i] != 0; i++) {
n += sum[i];
}
return n;
}
int reverse(int x) {
int sum[33] = { 0 };
int n=0;
int i;
if (x > 0) {
n=fun(sum,x);
}
else{
x = 0 - x;
n = 0 -fun(sum,x);
}
printf("%d", n);
return 0;
}