From 54077a8f49c4a75deff8337a47f12de800e4de85 Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?Soledad=20Naharro=20S=C3=A1nchez?= Date: Tue, 8 Apr 2025 21:18:29 +0200 Subject: [PATCH] primero --- src/functions-and-arrays.js | 238 +++++++++++++++++++++++++++++------- 1 file changed, 194 insertions(+), 44 deletions(-) diff --git a/src/functions-and-arrays.js b/src/functions-and-arrays.js index 3a7dbec..f45da48 100644 --- a/src/functions-and-arrays.js +++ b/src/functions-and-arrays.js @@ -1,41 +1,101 @@ // Iteration #1: Find the maximum -function maxOfTwoNumbers() {} - - +function maxOfTwoNumbers(a, b) { + return a > b ? a : b; +} // Iteration #2: Find longest word -const words = ['mystery', 'brother', 'aviator', 'crocodile', 'pearl', 'orchard', 'crackpot']; - -function findLongestWord() {} - - +const words = [ + 'mystery', + 'brother', + 'aviator', + 'crocodile', + 'pearl', + 'orchard', + 'crackpot', +]; +const meLoInvento = ['uno', 'dos', 'patata', 'astrolopitecus', 'hola', 'pan']; + +function findLongestWord(wordsArr) { + if (!wordsArr.length) return null; + let longestWord = ''; + for (let i = 0; i < wordsArr.length; i++) { + if (wordsArr[i].length > longestWord.length) { + longestWord = wordsArr[i]; + } + } + return longestWord; +} // Iteration #3: Calculate the sum const numbers = [6, 12, 1, 18, 13, 16, 2, 1, 8, 10]; -function sumNumbers() {} - - +function sumNumbers(numberArray) { + if (!numberArray.length) return 0; + if (numberArray.length === 0) return 0; + let suma = 0; + for (let i = 0; i < numberArray.length; i++) { + suma = suma + numberArray[i]; + } + return suma; +} // Iteration #3.1 Bonus: -function sum() {} +function sum(arr) { + if (!arr.length) return 0; + return arr.reduce((acc, elem) => { + if (typeof elem === "number") return acc + elem; + if (typeof elem === "string") return acc + elem.length; + if (typeof elem === "boolean") return acc + (elem ? 1 : 0); + throw new Error("Tipo de dato no soportado"); + } , 0); + } // Iteration #4: Calculate the average // Level 1: Array of numbers const numbersAvg = [2, 6, 9, 10, 7, 4, 1, 9]; -function averageNumbers() {} - +function averageNumbers(numberArray) { + if (!numberArray.length) return null; + let average = 0; + let suma = 0; + for (let i = 0; i < numberArray.length; i++) { + suma = suma + numberArray[i]; + average = suma / numberArray.length; + } + return average; +} // Level 2: Array of strings -const wordsArr = ['seat', 'correspond', 'linen', 'motif', 'hole', 'smell', 'smart', 'chaos', 'fuel', 'palace']; +const wordsArr = [ + 'seat', + 'correspond', + 'linen', + 'motif', + 'hole', + 'smell', + 'smart', + 'chaos', + 'fuel', + 'palace', +]; -function averageWordLength() { } +function averageWordLength(words) { + if (!words.length) return null; + let sumaWordLengt = 0; + let wordsLengthAverage = 0; + for (let i = 0; i < words.length; i++) { + sumaWordLengt = sumaWordLengt + words[i].length; + wordsLengthAverage = sumaWordLengt / words.length; + } + return wordsLengthAverage; +} // Bonus - Iteration #4.1 -function avg() {} +function avg(wordMixed) { + if (!wordMixed.length) return null; +} // Iteration #5: Unique arrays const wordsUnique = [ @@ -49,20 +109,66 @@ const wordsUnique = [ 'poison', 'communion', 'simple', - 'bring' + 'bring', ]; -function uniquifyArray() {} +function uniquifyArray(arr) { + if (!arr.length) return null; + //4 maneras. + //1ª Mediante un for + // let uniqueArr = []; + // for (let i = 0; i < arr.length; i++) { + // if (!uniqueArr.includes(arr[i])) { + // uniqueArr.push(arr[i]); + // } + // } + // return uniqueArr; + //2ª + // return arr.filter((item, index)=>arr.indexOf(item) === index) -// Iteration #6: Find elements -const wordsFind = ['machine', 'subset', 'trouble', 'starting', 'matter', 'eating', 'truth', 'disobedience']; + //3ª + // return [...new Set(arr)] -function doesWordExist() {} + // 4ª + let uniqueArr = []; + for (let i = 0; i < arr.length; i++) { + if (uniqueArr.indexOf(arr[i]) === -1) { + uniqueArr.push(arr[i]); + } + } + return uniqueArr; +} +// Iteration #6: Find elements +const wordsFind = [ + 'machine', + 'subset', + 'trouble', + 'starting', + 'matter', + 'eating', + 'truth', + 'disobedience', +]; +/* +function doesWordExist(words, find) { + if (!words.length) return null; + let result = false; + for (let i = 0; i < words.length; i++) { + if (find === words[i]) result = true; + } + return result; +} +*/ + +function doesWordExist(words, find) { + if (!words.length) return null; + return words.includes(find); +} // Iteration #7: Count repetition const wordsCount = [ 'machine', @@ -75,42 +181,86 @@ const wordsCount = [ 'matter', 'truth', 'disobedience', - 'matter' + 'matter', ]; -function howManyTimes() {} - - +function howManyTimes(arr, word) { + if (!arr.length) return 0; + let times = 0; + for (let i = 0; i < arr.length; i++) { + if (word === arr[i]) times = times + 1; + } + return times; +} // Iteration #8: Bonus const matrix = [ [8, 2, 22, 97, 38, 15, 0, 40, 0, 75, 4, 5, 7, 78, 52, 12, 50, 77, 91, 8], - [49, 49, 99, 40, 17, 81, 18, 57, 60, 87, 17, 40, 98, 43, 69, 48, 4, 56, 62, 0], - [81, 49, 31, 73, 55, 79, 14, 29, 93, 71, 40, 67, 53, 88, 30, 3, 49, 13, 36, 65], + [ + 49, 49, 99, 40, 17, 81, 18, 57, 60, 87, 17, 40, 98, 43, 69, 48, 4, 56, 62, + 0, + ], + [ + 81, 49, 31, 73, 55, 79, 14, 29, 93, 71, 40, 67, 53, 88, 30, 3, 49, 13, 36, + 65, + ], [52, 70, 95, 23, 4, 60, 11, 42, 69, 24, 68, 56, 1, 32, 56, 71, 37, 2, 36, 91], - [22, 31, 16, 71, 51, 67, 63, 89, 41, 92, 36, 54, 22, 40, 40, 28, 66, 33, 13, 80], - [24, 47, 32, 60, 99, 3, 45, 2, 44, 75, 33, 53, 78, 36, 84, 20, 35, 17, 12, 50], - [32, 98, 81, 28, 64, 23, 67, 10, 26, 38, 40, 67, 59, 54, 70, 66, 18, 38, 64, 70], - [67, 26, 20, 68, 2, 62, 12, 20, 95, 63, 94, 39, 63, 8, 40, 91, 66, 49, 94, 21], - [24, 55, 58, 5, 66, 73, 99, 26, 97, 17, 78, 78, 96, 83, 14, 88, 34, 89, 63, 72], + [ + 22, 31, 16, 71, 51, 67, 63, 89, 41, 92, 36, 54, 22, 40, 40, 28, 66, 33, 13, + 80, + ], + [ + 24, 47, 32, 60, 99, 3, 45, 2, 44, 75, 33, 53, 78, 36, 84, 20, 35, 17, 12, + 50, + ], + [ + 32, 98, 81, 28, 64, 23, 67, 10, 26, 38, 40, 67, 59, 54, 70, 66, 18, 38, 64, + 70, + ], + [ + 67, 26, 20, 68, 2, 62, 12, 20, 95, 63, 94, 39, 63, 8, 40, 91, 66, 49, 94, + 21, + ], + [ + 24, 55, 58, 5, 66, 73, 99, 26, 97, 17, 78, 78, 96, 83, 14, 88, 34, 89, 63, + 72, + ], [21, 36, 23, 9, 75, 0, 76, 44, 20, 45, 35, 14, 0, 61, 33, 97, 34, 31, 33, 95], [78, 17, 53, 28, 22, 75, 31, 67, 15, 94, 3, 80, 4, 62, 16, 14, 9, 53, 56, 92], - [16, 39, 5, 42, 96, 35, 31, 47, 55, 58, 88, 24, 0, 17, 54, 24, 36, 29, 85, 57], + [ + 16, 39, 5, 42, 96, 35, 31, 47, 55, 58, 88, 24, 0, 17, 54, 24, 36, 29, 85, + 57, + ], [86, 56, 0, 48, 35, 71, 89, 7, 5, 44, 44, 37, 44, 60, 21, 58, 51, 54, 17, 58], - [19, 80, 81, 68, 5, 94, 47, 69, 28, 73, 92, 13, 86, 52, 17, 77, 4, 89, 55, 40], + [ + 19, 80, 81, 68, 5, 94, 47, 69, 28, 73, 92, 13, 86, 52, 17, 77, 4, 89, 55, + 40, + ], [4, 52, 8, 83, 97, 35, 99, 16, 7, 97, 57, 32, 16, 26, 26, 79, 33, 27, 98, 66], - [88, 36, 68, 87, 57, 62, 20, 72, 3, 46, 33, 67, 46, 55, 12, 32, 63, 93, 53, 69], - [4, 42, 16, 73, 38, 25, 39, 11, 24, 94, 72, 18, 8, 46, 29, 32, 40, 62, 76, 36], - [20, 69, 36, 41, 72, 30, 23, 88, 34, 62, 99, 69, 82, 67, 59, 85, 74, 4, 36, 16], - [20, 73, 35, 29, 78, 31, 90, 1, 74, 31, 49, 71, 48, 86, 81, 16, 23, 57, 5, 54], - [1, 70, 54, 71, 83, 51, 54, 69, 16, 92, 33, 48, 61, 43, 52, 1, 89, 19, 67, 48] + [ + 88, 36, 68, 87, 57, 62, 20, 72, 3, 46, 33, 67, 46, 55, 12, 32, 63, 93, 53, + 69, + ], + [ + 4, 42, 16, 73, 38, 25, 39, 11, 24, 94, 72, 18, 8, 46, 29, 32, 40, 62, 76, + 36, + ], + [ + 20, 69, 36, 41, 72, 30, 23, 88, 34, 62, 99, 69, 82, 67, 59, 85, 74, 4, 36, + 16, + ], + [ + 20, 73, 35, 29, 78, 31, 90, 1, 74, 31, 49, 71, 48, 86, 81, 16, 23, 57, 5, + 54, + ], + [ + 1, 70, 54, 71, 83, 51, 54, 69, 16, 92, 33, 48, 61, 43, 52, 1, 89, 19, 67, + 48, + ], ]; function greatestProduct() {} - - - // The following is required to make unit tests work. /* Environment setup. Do not modify the below code. */ if (typeof module !== 'undefined') { @@ -125,6 +275,6 @@ if (typeof module !== 'undefined') { uniquifyArray, doesWordExist, howManyTimes, - greatestProduct + greatestProduct, }; }