-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathEx.8.html
64 lines (55 loc) · 2.56 KB
/
Ex.8.html
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
61
62
63
64
<!doctype html>
<html lang="en">
<head>
<meta charset="UTF-8">
<meta name="viewport"
content="width=device-width, user-scalable=no, initial-scale=1.0, maximum-scale=1.0, minimum-scale=1.0">
<meta http-equiv="X-UA-Compatible" content="ie=edge">
<link rel="stylesheet" href="style.css">
<link href="https://fonts.googleapis.com/css?family=Fira+Sans+Extra+Condensed" rel="stylesheet">
<title>Document</title>
</head>
<body>
<img src="https://www.codewars.com/users/stefan835/badges/large" alt="codewars-badge">
<h1>Ex.8</h1>
<h3><a href="./Ex.7.html">Link to previos!</a></h3>
<h3><a href="./Ex.9.html">Link to next!</a></h3>
<p>Write a function, persistence, that takes in a positive parameter num and returns its multiplicative persistence,
which is the number of times you must multiply the digits in num until you reach a single digit.</p>
<h4> For example:</h4>
<pre><i>persistence(39) === 3 // because 3*9 = 27, 2*7 = 14, 1*4=4<br/>// and 4 has only one digit<br/><br/>persistence(999) === 4 // because 9*9*9 = 729, 7*2*9 = 126,<br/>// 1*2*6 = 12, and finally 1*2 = 2<br/><br/>persistence(4) === 0 // because 4 is already a one-digit number</i></pre>
<h2>My solution</h2>
<div class="code">
<pre>function persistence(num) {<br/> let numberOfRuns = 0;<br/> for (let currentNumber = num; currentNumber >= 10;) {<br/> numberOfRuns += 1;<br/> let numArr = currentNumber.toString().split('');<br/> currentNumber = numArr.reduce((prevNum, nextNum) => {<br/> return parseInt(prevNum) * parseInt(nextNum)<br/> })<br/> }<br/> return numberOfRuns<br/>}</pre>
</div>
<h2>Best solution</h2>
<div class="code">
<pre><br/>const persistence = num => {<br/> return `${num}`.length > 1<br/> ? 1 + persistence(`${num}`.split('').reduce((a, b) => a * +b))<br/> : 0;<br/>}</pre>
</div>
<h2 class="passed">PASSED</h2>
<h3>Time: 501ms</h3>
<script>
//MY SOLUTION
function persistence(num) {
let numberOfRuns = 0;
for (let currentNumber = num; currentNumber >= 10;) {
numberOfRuns += 1;
let numArr = currentNumber.toString().split('');
currentNumber = numArr.reduce((prevNum, nextNum) => {
return parseInt(prevNum) * parseInt(nextNum)
})
}
return numberOfRuns
}
console.log(persistence(999)) //=== 4 // because 9*9*9 = 729, 7*2*9 = 126,
// 1*2*6 = 12, and finally 1*2 = 2
//BEST SOLUTION
//
// const persistence = num => {
// return `${num}`.length > 1
// ? 1 + persistence(`${num}`.split('').reduce((a, b) => a * +b))
// : 0;
// }
</script>
</body>
</html>