Reverse digits of an integer.

Example1: x = 123, return 321

Example2: x = -123, return -321

Have you thought about this?

Here are some good questions to ask before coding. Bonus points for you if you have already thought through this!

If the integer's last digit is 0, what should the output be? ie, cases such as 10, 100.

Did you notice that the reversed integer might overflow? Assume the input is a 32-bit integer, then the reverse of 1000000003 overflows. How should you handle such cases?

For the purpose of this problem, assume that your function returns 0 when the reversed integer overflows.

最近做的几题好像都是考数学相关的，所以界限以及判断很重要。

 

如果为最小的负数，应该直接返回0，而不能将其转换为正数之后再转换为负数。

 

C++代码如下：

#include
      
       #include
       
        using namespace std;class Solution{public:    int reverse(int x)    {        //如果x刚好等于INT_MIN,那么不能先将x转换为正数然后转换为负数        if(x==0||x==INT_MIN)            return 0;        int flag=1;        if(x<0)        {            x=-x;            flag=-1;        }        long long i=1;        long long j=10;        while(i<=x)        {            i*=10;        }        i=i/10;        long long sum=0;        while(j<=i)        {            sum+=(x/i)*(j/10)+(x%j)/(j/10)*i;            if(flag==1&&sum>INT_MAX)                return 0;            else if(flag==-1&&-sum
        
         INT_MAX)            return 0;        else if(flag==-1&&-sum
        
       
      

 

方法二：

int reverse(int x) {        if(x==0||x==INT_MIN)            return 0;        int flag=1;        if(x<0)        {            x=-x;            flag=-1;        }        long long res=0;        while(x)        {            res=res*10+x%10;            x/=10;        }        if((flag==1&&res>INT_MAX)||-res