From 9c6136638bdd90276f84407ae2e8453296235bcd Mon Sep 17 00:00:00 2001 From: Jorge Date: Tue, 25 Jun 2019 21:25:06 +0200 Subject: [PATCH 1/2] done --- src/functions-and-arrays.js | 112 +++++++++++++++++++++++++++++++++++- 1 file changed, 111 insertions(+), 1 deletion(-) diff --git a/src/functions-and-arrays.js b/src/functions-and-arrays.js index 2fcd81e6e..29bf57937 100644 --- a/src/functions-and-arrays.js +++ b/src/functions-and-arrays.js @@ -1,4 +1,10 @@ // Find the maximum +function maxOfTwoNumbers (x,y){ + if(x > y){ + return x; + } + return y; +} // Finding Longest Word var words = [ @@ -10,14 +16,54 @@ var words = [ 'orchard', 'crackpot' ]; +var largest = ''; + +function findLongestWord(words){ + if(words.length === 0){ + return undefined; + } + if(words.length === 1){ + return words[0]; + } + for(var i = 0; i < (words.length - 1); i++){ + if(words[i].length >= words[i + 1].length){ + largest = words[i]; + } + } +return largest; +} + // Calculating a Sum var numbers = [6, 12, 1, 18, 13, 16, 2, 1, 8, 10]; +function sumArray (numbers){ + var suma = 0; + if (numbers.length === 0){ + return 0; + } + for(var i = 0; i < numbers.length; i++){ + suma = suma + numbers[i]; + } +return suma; +} + // Calculate the Average var numbersAvg = [2, 6, 9, 10, 7, 4, 1, 9]; +function averageNumbers(numbersAvg){ + var suma = 0; + var media = 0; + if (numbersAvg.length === 0){ + return undefined; + } + for(var i = 0; i < numbersAvg.length; i ++){ + suma = suma + numbersAvg[i]; + media = suma/numbersAvg.length + } + return media; +} // Array of Strings var wordsArr = [ @@ -32,6 +78,21 @@ var wordsArr = [ 'fuel', 'palace' ]; +function averageWordLength(wordsArr){ + var suma = 0; + var media = 0; + if (wordsArr.length === 0){ + return undefined; + } + if(wordsArr.length === 1){ + return wordsArr[0].length; + } + for(var i = 0; i < wordsArr.length; i ++){ + suma = suma + wordsArr[i].length; + media = suma / wordsArr.length; + } + return media; +} // Unique Arrays var wordsUnique = [ @@ -47,6 +108,22 @@ var wordsUnique = [ 'simple', 'bring' ]; +function uniquifyArray(arr){ + var nuevoArray = []; + if (arr.length === 0){ + return undefined; + } + if(arr.length === 1){ + nuevoArray.push(arr.length) + return nuevoArray; + } + for(var i = 0; i < arr.length; i++){ + if(arr.indexOf(arr[i]) === i){ + nuevoArray.push(arr[i]) + } + } +return nuevoArray; +} // Finding Elements var wordsFind = [ @@ -59,7 +136,20 @@ var wordsFind = [ 'truth', 'disobedience' ]; - +function doesWordExist(arr, word) { + if (arr.length === 0){ + return false; + } + if(arr.length === 1){ + return true; + } + for (var i = 0; i < arr.length; i++){ + if(arr[i] === word){ + return true; + } + } + return false; +} // Counting Repetion var wordsCount = [ 'machine', @@ -74,6 +164,25 @@ var wordsCount = [ 'disobedience', 'matter' ]; + +function howManyTimes(arr,word, times){ + if (arr.length === 0){ + return false; + } + if(arr.length === 1){ + return arr.length; + } + for(var i = 0; i < arr.length; i++){ + if(arr[i] !== word){ + return zero; + } + if(arr[i] === word && times === 5){ + return times; + } + + } + +} // Bonus Quest var matrix = [ @@ -98,3 +207,4 @@ var matrix = [ [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] ]; + From 3345823ee7e243ab8e07313c2eb9a6bf5da16f94 Mon Sep 17 00:00:00 2001 From: Jorge Date: Fri, 6 Sep 2019 19:46:18 +0200 Subject: [PATCH 2/2] actualizacion ejercicio --- src/functions-and-arrays.js | 177 +++++++++++++++--------------------- 1 file changed, 74 insertions(+), 103 deletions(-) diff --git a/src/functions-and-arrays.js b/src/functions-and-arrays.js index 29bf57937..90d74b0e6 100644 --- a/src/functions-and-arrays.js +++ b/src/functions-and-arrays.js @@ -1,12 +1,18 @@ -// Find the maximum -function maxOfTwoNumbers (x,y){ - if(x > y){ - return x; +'use strict' + +// find de maximun + +function maximun(a , b){ + if(a > b){ + return console.log(a) + }else{ + return console.log(b) } - return y; } +maximun(10,5) + +//find de longest word -// Finding Longest Word var words = [ 'mystery', 'brother', @@ -16,57 +22,46 @@ var words = [ 'orchard', 'crackpot' ]; -var largest = ''; - +let longestWord = '' function findLongestWord(words){ - if(words.length === 0){ - return undefined; - } - if(words.length === 1){ - return words[0]; - } for(var i = 0; i < (words.length - 1); i++){ - if(words[i].length >= words[i + 1].length){ - largest = words[i]; + if(words[i].length > words[i + 1].length){ + longestWord = words[i] } } -return largest; + return longestWord } +console.log(findLongestWord(words)) - -// Calculating a Sum +//Sum var numbers = [6, 12, 1, 18, 13, 16, 2, 1, 8, 10]; - -function sumArray (numbers){ - var suma = 0; - if (numbers.length === 0){ - return 0; +var sum = 0; +function sumNumbers(numbers){ + for(var i = 0; i < numbers.length; i++) { + sum = sum + numbers[i]; } - for(var i = 0; i < numbers.length; i++){ - suma = suma + numbers[i]; - } -return suma; + return sum; } +console.log(sumNumbers(numbers)) -// Calculate the Average +//Average -var numbersAvg = [2, 6, 9, 10, 7, 4, 1, 9]; -function averageNumbers(numbersAvg){ - var suma = 0; - var media = 0; - if (numbersAvg.length === 0){ - return undefined; - } - for(var i = 0; i < numbersAvg.length; i ++){ - suma = suma + numbersAvg[i]; - media = suma/numbersAvg.length - } - return media; +var numbers = [6, 12, 1, 18, 13, 16, 2, 1, 8, 10]; +var sum = 0; +var average = 0; +function averageNumbers (numbers) { + for(var i = 0; i < numbers.length; i++) { + sum = sum + numbers[i]; + average = sum / numbers.length + } + return average } +console.log(averageNumbers(numbers)) + +//Average String -// Array of Strings -var wordsArr = [ +var words = [ 'seat', 'correspond', 'linen', @@ -78,24 +73,16 @@ var wordsArr = [ 'fuel', 'palace' ]; -function averageWordLength(wordsArr){ - var suma = 0; - var media = 0; - if (wordsArr.length === 0){ - return undefined; - } - if(wordsArr.length === 1){ - return wordsArr[0].length; - } - for(var i = 0; i < wordsArr.length; i ++){ - suma = suma + wordsArr[i].length; - media = suma / wordsArr.length; - } - return media; +function averageString(words){ +var amountLetters = words.join('') +var average = amountLetters.length / words.length +return average } +console.log(averageString(words)) -// Unique Arrays -var wordsUnique = [ +//Unique array + +var words = [ 'crab', 'poison', 'contagious', @@ -108,25 +95,19 @@ var wordsUnique = [ 'simple', 'bring' ]; -function uniquifyArray(arr){ - var nuevoArray = []; - if (arr.length === 0){ - return undefined; +var uniqueWord = []; +function uniqueArray(words){ + for(var i = 0; i < words.length; i++){ + if(words.indexOf(words[i]) === i) + uniqueWord.push(words[i]) } - if(arr.length === 1){ - nuevoArray.push(arr.length) - return nuevoArray; - } - for(var i = 0; i < arr.length; i++){ - if(arr.indexOf(arr[i]) === i){ - nuevoArray.push(arr[i]) - } - } -return nuevoArray; + return(uniqueWord) } +console.log(uniqueArray(words)) -// Finding Elements -var wordsFind = [ +//Search word + +var words = [ 'machine', 'subset', 'trouble', @@ -136,22 +117,20 @@ var wordsFind = [ 'truth', 'disobedience' ]; -function doesWordExist(arr, word) { - if (arr.length === 0){ - return false; - } - if(arr.length === 1){ - return true; - } - for (var i = 0; i < arr.length; i++){ - if(arr[i] === word){ - return true; + +function doesWordExist(words, word){ + for(var i = 0; i < words.length; i ++){ + if(words[i] === word){ + return console.log('true'); } } return false; } -// Counting Repetion -var wordsCount = [ +doesWordExist(words, 'eating') + +//How many times + +var words = [ 'machine', 'matter', 'subset', @@ -164,25 +143,17 @@ var wordsCount = [ 'disobedience', 'matter' ]; - -function howManyTimes(arr,word, times){ - if (arr.length === 0){ - return false; - } - if(arr.length === 1){ - return arr.length; - } - for(var i = 0; i < arr.length; i++){ - if(arr[i] !== word){ - return zero; +var count = 0; +function howManytimes(words, word){ + for(var i = 0; i < words.length; i++){ + if(words[i] === word){ + count++; } - if(arr[i] === word && times === 5){ - return times; - } - } - + return count; } +console.log(howManytimes(words,'matter')) + // Bonus Quest var matrix = [