Algorithm


 
Medium

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

 

Code Examples

#1 Code Example with Javascript Programming

Code - Javascript Programming


var reverse = function(x) {
    let rev = 0;
    let rem;
    let isNegative = x < 0;
    
    if (isNegative)
        x = (-1) * x;
 
    while(x != 0 ) {
      rem = x % 10;
      x = parseInt(x / 10); 
      rev = parseInt(rev + '' + rem);
    }
    
    if (rev > 0x7FFFFFFF)
        return 0;
    
    if (isNegative)
        return (-1) * rev;
    
    return rev;
};
Copy The Code & Try With Live Editor

Input

x
+
cmd
123

Output

x
+
cmd
321

Demonstration


Leetcode - Reverse Integer Solution in Javascript