-
Notifications
You must be signed in to change notification settings - Fork 30
/
add-digits.js
36 lines (34 loc) · 977 Bytes
/
add-digits.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
// Given a non-negative integer num, repeatedly add all its digits until the result has only one digit.
//
//
//
// For example:
//
//
// Given num = 38, the process is like: 3 + 8 = 11, 1 + 1 = 2. Since 2 has only one digit, return it.
//
//
// Follow up:
// Could you do it without any loop/recursion in O(1) runtime?
//
//
//
// A naive implementation of the above process is trivial. Could you come up with other methods?
// What are all the possible results?
// How do they occur, periodically or randomly?
// You may find this Wikipedia article useful.
//
//
// Credits:Special thanks to @jianchao.li.fighter for adding this problem and creating all test cases.
/**
* @param {number} num
* @return {number}
*/
var addDigits = function(num) {
var str = num.toString();
if (str.length === 1) {
return +str;
}
var result = str.split('').reduce((memo, current) => +memo + +current);
return addDigits(result);
};