-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathadd-digits.js
More file actions
45 lines (32 loc) · 810 Bytes
/
add-digits.js
File metadata and controls
45 lines (32 loc) · 810 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
41
42
43
44
45
/*
Given an integer num, repeatedly add all its digits until the result has only one digit, and return it.
Example 1:
Input: num = 38
Output: 2
Explanation: The process is
38 --> 3 + 8 --> 11
11 --> 1 + 1 --> 2
Since 2 has only one digit, return it.
Example 2:
Input: num = 0
Output: 0
Constraints:
0 <= num <= 231 - 1
Follow up: Could you do it without any loop/recursion in O(1) runtime?
*/
/**
* @param {number} num
* @return {number}
*/
var addDigits = function(num) {
while (num.toString().length > 1){
let holder = 0
console.log(num.toString().split('').length)
for (let i = 0; i < num.toString().split('').length; i++){
holder += num.toString().split('')[i] * 1
}
num = holder
console.log(num)
}
return num
};