7. Reverse Integer

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.

class Solution {
public:
     int reverse(int x) {
       long int s=0; //long 类型
         int s1=0;  //int 类型  二者不等 就溢出
        int k;
		 if(x==0) return 0;
        if(x>0) k=1; //正数
        else  k=0;
        while(x%10==0) x=x/10;//去掉尾数0
        
       
        x=abs(x);
         int t=x;
          while(t) {s1=s1*10+t%10 ;t=t/10;}
         while(x) {s=s*10+x%10 ;x=x/10;}
         if(s1==s);
         else s=0;
		
      
        if(k==1) return s;
        else return s=s*(-1);
        
    }
};