jeremymouzin
/ challenge4.js
Last active
June 28, 2020 13:10
Challenge 4 du Challenge JavaScript 10 jours de Scrimba
This file contains hidden or 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
| // Version lisible pour débutants | |
| function arrayReplace(tableau, nombreARemplacer, nouvelleValeur) { | |
| const resultat = []; | |
| for(nombre of tableau) { | |
| if (nombre === nombreARemplacer) { | |
| resultat.push(nouvelleValeur); | |
| } else { | |
| resultat.push(nombre); | |
| } | |
| } |
jeremymouzin
/ challenge3.js
Last active
June 28, 2020 06:05
Challenge 3 du Challenge JavaScript 10 jours de Scrimba
This file contains hidden or 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
| // Version lisible pour débutants | |
| function alternatingSums(tableau) { | |
| let sommePaires = 0; | |
| let sommeImpaires = 0; | |
| for (let i = 0; i < tableau.length; i++) { | |
| if (i % 2 === 0) { | |
| sommePaires = sommePaires + tableau[i]; | |
| } else { | |
| sommeImpaires = sommeImpaires + tableau[i]; | |
| } |
jeremymouzin
/ challenge2.js
Last active
June 28, 2020 06:05
Challenge 2 du Challenge JavaScript 10 jours de Scrimba
This file contains hidden or 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
| // Version lisible pour débutants | |
| function allLongestStrings(tableauDeChaines) { | |
| let longueurMax = 0; | |
| for (chaine of tableauDeChaines) { | |
| if (longueurMax < chaine.length) { | |
| longueurMax = chaine.length; | |
| } | |
| } | |
| let plusLonguesChaines = []; | |
| for (chaine of tableauDeChaines) { |
jeremymouzin
/ challenge1.js
Last active
June 28, 2020 14:58
Challenge 1 du Challenge JavaScript 10 jours de Scrimba
This file contains hidden or 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
| // Version lisible pour débutants | |
| function add(...nombres) { | |
| let somme = 0; | |
| for (nombre of nombres) { | |
| somme = somme + nombre; | |
| } | |
| return somme; | |
| } | |
| // Version avancée plus compacte |
jeremymouzin
/ gist:2bbc19a4425ceb84ffa561a035149561
Last active
February 14, 2020 17:44
Correction du code de sam pour son jeu de morpion
This file contains hidden or 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
| <!DOCTYPE html> | |
| <html> | |
| <head> | |
| <meta charset="utf-8"> | |
| <title>demo html</title> | |
| </head> | |
| <body> | |
| <h3>jeux morpion</h3> |
NewerOlder