FilesExpand file tree

 master

/

7.reverse-integer.js

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

60 lines (60 loc) · 1.15 KB

 master

/

7.reverse-integer.js

Copy path

Top

File metadata and controls

• Code
• Blame

60 lines (60 loc) · 1.15 KB

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

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

50

51

52

53

54

55

56

57

58

59

60

/*

* @lc app=leetcode id=7 lang=javascript

*

* [7] Reverse Integer

*

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

*

* algorithms

* Easy (25.20%)

* Total Accepted: 630.6K

* Total Submissions: 2.5M

* Testcase Example: '123'

*

* 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: [−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) {

if (typeof x !== 'number') {

return 0;

}

const r = x.toString().split('').reverse().join('');

const result = Number(r.replace(/(0+)?(\d+)(-)?/, function($0, $1, $2, $3) {

return $3 ? $3+$2 : $2

}))

if (result > Math.pow(2,31) - 1 || result < -1 * Math.pow(2,31)) {

return 0;

}

return result;

};