-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathreverseInteger.js
More file actions
40 lines (31 loc) · 941 Bytes
/
reverseInteger.js
File metadata and controls
40 lines (31 loc) · 941 Bytes
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
// https://leetcode.com/problems/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.
*********************************************************/
/* Solution */
/*
* @param {number} x
* @return {number}
*/
var reverse = function(x) {
var maxNum = Math.pow(2,31) - 1;
var num = x.toString().split("").reverse().join("");
if(num.indexOf('-') !== -1) {
num = '-' + num.replace('-','');
}
if(num > maxNum || num < -(maxNum)) {
return 0;
}
return parseInt(num);
};