forked from rubythonode/javascript-problems-and-solutions
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathreverse-integer.js
49 lines (43 loc) · 839 Bytes
/
reverse-integer.js
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
/**
* Reverse Integer
*
* Given a 32-bit signed integer, reverse digits of an integer.
*
* Example 1:
*
* Input: 123
* Output: 321
*
* Example 2:
*
* Input: -123
* Output: -321
*
* Example 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:
* [−231, 231 − 1]. For the purpose of this problem, assume that your function returns 0 when the reversed integer
* overflows.
*/
/**
* @param {number} x
* @return {number}
*/
const reverse = x => {
const MAX = Math.pow(2, 31) - 1;
const MIN = -Math.pow(2, 31);
let res = 0;
while (x !== 0) {
res = res * 10 + (x % 10);
x = parseInt(x / 10);
if (res > MAX || res < MIN) {
return 0;
}
}
return res;
};
export { reverse };