LeetCode_Reverse Integer

Reverse digits of an integer.

Example1: x = 123, return 321
Example2: x = -123, return -321

click to show spoilers.

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?

Throw an exception? Good, but what if throwing an exception is not an option? You would then have to re-design the function (ie, add an extra parameter).

一下是我的代码，没有考虑异常处理机制“：

class Solution {
public:
    int reverse(int x) {
        if(!x) return x;
        
        int temp=0;
        int weight=1;
        int revx=x;
        if(revx<0) revx=abs(revx);
        
        while(revx){
            int t=revx%10;
            revx=revx/10;
            temp=temp*10+t;
        }
        
        if(x<0){
            x=-temp;
        }
        else{
            x=temp;
        }
        return x;
    }
};

在网上查找了别人的考虑异常的方法：

int reverse(int x) {  
     // Start typing your C/C++ solution below  
     // DO NOT write int main() function  
     int lastDigit = 0;  
     int result = 0;  
     bool isNeg = x>0? false:true;  
     x = abs(x);  
     while(x>0)  
     {  
       lastDigit = x%10;  
       result = result*10 + lastDigit;  
       x = x/10;  
     }  
     if(result<0) return -1;  
     if(isNeg)  
       result *=-1;  
     return result;      
   } 

其实大家思路都差不多，就是用给出的数去滚动生成新数，但是如果在溢出情况出现的情况下，仍要进行转换的话，那就需要字符串string来存储相应的数字了吧，这是我自己想的，有待确认再查！