[leetcode] 7. Reverse Integer 문제 풀이

https://leetcode.com/problems/reverse-integer/

Reverse Integer - LeetCode

 

< problem >

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  [-2^31, 2^31 - 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

 

Example 4:

Input: x = 0 Output: 0

 

Constraints:

• -231 <= x <= 231 - 1

 

< solve >

let reverse = function(x) {  
    let reverseNumber = Number(String(Math.abs(x)).split('').reverse().join(''));
      
    if (0x7FFFFFFF < reverseNumber) {
        return 0;
    }
    
    return x < 0 ? -reverseNumber : reverseNumber;
};