Persistent bugger: https://www.codewars.com/kata/55bf01e5a717a0d57e0000ec
📊 Compare perfs of different versions.
Last active
August 26, 2020 05:45
-
-
Save abernier/3852c326558525b3b1489f2be531f4b5 to your computer and use it in GitHub Desktop.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| function persistence(num) { | |
| // | |
| // Brouillon | |
| // --- | |
| // ex avec 99 | |
| // 9 9 -> 9*9 -> splitter le num en une liste de digits | |
| // | |
| // Pseudo-code: | |
| // --- | |
| // declarer un compteur | |
| // tant que le prod >= 10 | |
| // splitter les digits | |
| // faire le produit des digits | |
| // compteur++ | |
| // | |
| // retourner le compteur | |
| // | |
| let i = 0; | |
| let prod = num; // 99 | |
| while (prod >= 10) { | |
| // splitter les digits (en un tableau de chiffres) | |
| const digits = (""+prod).split('').map(el => Number(el)) // [9, 9] | |
| // en faire le produit | |
| prod = digits.reduce((acc, el) => acc * el) // 81 | |
| i++ // 1 | |
| } | |
| return i | |
| } |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| // recursive version | |
| function persistence(num, a=0) { | |
| if (num >= 10) { | |
| const digits = (""+num).split('').map(el => +el); | |
| const prod = digits.reduce((acc, el) => acc*el); | |
| return persistence(prod, a+1) | |
| } else { | |
| return a; | |
| } | |
| } |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment