leetcode——7—— Reverse Integer可仿溢出

Reverse digits of an integer.

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

class Solution {
public:
    int reverse(int x) {
    
    long sum=0; 
     while (x!=0) 
     { 
          int s=x%10; 
          sum=sum*10+s; 
          x=x/10; 
     } 
   if (sum>INT_MAX||sum<INT_MIN) 
   { 

       return 0; 
   } 
    return (int)sum; 



    }
};