Given a 32-bit signed integer, reverse digits of an integer.
- 32 비트 부호있는 정수 값이 주어지면, 정수를 뒤집어라
Example 1:
Input: 123
Output: 321Example 2:
Input: -123
Output: -321Example 3:
Input: 120
Output: 21
Note
Assume we are dealing with an environment which could only store integers within the 32-bit signed integer range: [−2^31, 2^31 − 1].
For the purpose of this problem, assume that your function returns 0 when the reversed integer overflows.
// 초기코드
/**
* @param {number} x
* @return {number}
*/
var reverse = function(x) {
};
/**
* @param {number} x
* @return {number}
*/
var reverse = function(x) {
const minInteger = Math.pow(-2, 31);
const maxInteger = Math.pow(2, 31) - 1;
let minusFlag = false;
if(x < 0) {
minusFlag = true;
}
let reverseNumber = String(Math.abs(x)).split('').reverse().join('');
if(minusFlag) {
reverseNumber = reverseNumber * -1;
}
if(minInteger <= reverseNumber && maxInteger >= reverseNumber) {
return reverseNumber;
} else {
return 0;
}
};