Type Here to Get Search Results !

Reverse integer leetcode solution.

0

 Reverse integer leetcode solution.


Given a signed 32-bit integer x, return x with its digits reversed. If reversing x causes the value to go outside the signed 32-bit integer range [-231, 231 - 1], then return 0.

Assume the environment does not allow you to store 64-bit integers (signed or unsigned).

 

Example 1:

Input: x = 123
Output: 321

Example 2:

Input: x = -123
Output: -321

Example 3:

Input: x = 120
Output: 21
 

Constraints:

-231 <= x <= 231 - 1


Reverse integer using Java :-

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

Post a Comment

0 Comments