一 反转整数
题目链接:https://leetcode-cn.com/problems/reverse-integer/
自力更生
class Solution {
public:
int reverse(int x) {
int max_int=INT_MAX;
int min_int=INT_MIN;
if(x>0)
{
long long ans=0;
while(x)
{
ans=ans*10+x%10;
x/=10;
}
if(ans>max_int)
return 0;
else
return ans;
}
else if(x<0)
{
long long y=abs((long long)x);
long long ans=0;
while(y)
{
ans=ans*10+y%10;
y/=10;