solution


  • 0
    W

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


Log in to reply
 

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.