Leetcode-007-整数反转

class Solution {
    public int reverse(int x) {
        
        long result = 0;
        while(x!=0){
            result = result*10 + x%10;
            x/=10;
        }
        if(result > Integer.MAX_VALUE || result<Integer.MIN_VALUE){
            return 0;
        }
        return (int)result;
    }
}

class Solution:
    def reverse(self, x: int) -> int:
        if(x<0):
            isPos = -1
            x = x*isPos
        else:
            isPos = 1
        result = 0
        while x!=0:
            result = result * 10 + x % 10
            x//=10
        if result>2**31-1 or -result<-2**31:
            return 0
        return isPos*result