//看看人家 写的多简单 INT_MIN INT_MAX 2^31 -1 -2^31 7. 整数反转
class Solution {
public:
int reverse(int x) {
int fh = 0;
if(x == 0) return x;
if(x > 0) fh=1;
else fh = -1;
double x1 = fabs(x);
double temp =x1 - ((int)(x1/10))*10;
x1 = (int)(x1/10);
while(fabs(x1 - 0) > 1e-2)
{
temp =temp*10 + (x1 - ((int)(x1/10))*10);
x1 = (int)(x1/10);
}
if(((temp+1) > pow(2,31)) || (temp < -1*pow(2,31))) return 0;
return ((int)temp)*fh;
}
};
53 -leetcode 7. 整数反转
最新推荐文章于 2024-09-26 17:17:04 发布