leetcode 7Reverse Integer 模拟

Reverse digits of an integer.

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

click to show spoilers.

Note:
The input is assumed to be a 32-bit signed integer. Your function should return 0 when the reversed integer overflows.

Subscribe to see which companies asked this question.

class Solution(object):
    def reverse(self, x):
        t = 1
        if x < 0:
            t = -1
        x = abs(x)
        s = 0
        while x > 0:
            s = s * 10 + int(x % 10)
            x = int(x / 10)
        maxInt = 0x7fffffff
        if s > maxInt:
            return  0
        s = t * s
        return int(s)


if __name__ == '__main__':
    s = Solution()
    print(s.reverse(-123))
    print(s.reverse(123))

import  java.util.* ;

public class Solution{
	 
	   public int reverse(int x){
		      int t = x < 0 ? -1 : 1 ;
		      x = Math.abs(x) ;
		      long s = 0 ;
		      while(x > 0){
		    	   s = s * 10 + x % 10 ;
		    	   x /= 10 ;
		      }
		      int max_int = 0x7fffffff ;
		      if(s > max_int) return 0 ;
		      s = t * s ;
	          return  (int)s ; 
	   }
	   
	   public static void main(String[] args){
		     
		      System.out.println(new Solution().reverse(1534236469) )  ; 
	   }
}