From 60b039479c09de4a86d04c0728190d19e64c6492 Mon Sep 17 00:00:00 2001 From: shuyuan-cao Date: Mon, 29 Jan 2024 01:04:42 +0100 Subject: [PATCH 1/2] Tasks half part finished --- src/functions-and-arrays.js | 157 +++++++++++++++++++++++++++--------- 1 file changed, 117 insertions(+), 40 deletions(-) diff --git a/src/functions-and-arrays.js b/src/functions-and-arrays.js index 3a7dbec41..bf4a1ae0e 100644 --- a/src/functions-and-arrays.js +++ b/src/functions-and-arrays.js @@ -1,38 +1,73 @@ // Iteration #1: Find the maximum -function maxOfTwoNumbers() {} - - +function maxOfTwoNumbers(num1, num2) { + if (num1 > num2) { + return num1; + } else { + return num2; + } +} // Iteration #2: Find longest word -const words = ['mystery', 'brother', 'aviator', 'crocodile', 'pearl', 'orchard', 'crackpot']; +const words = [ + 'mystery', + 'brother', + 'aviator', + 'crocodile', + 'pearl', + 'orchard', + 'crackpot', +]; -function findLongestWord() {} +function findLongestWord() { + if (words.length == 0) { + return null; + } + let longestWord = words[0]; + for (let w = 1; w < words.length; w++) { + if (longestWord.length < words[w].length) { + longestWord = words[w]; + } + } + return longestWord; +} // Iteration #3: Calculate the sum const numbers = [6, 12, 1, 18, 13, 16, 2, 1, 8, 10]; -function sumNumbers() {} - - +function sumNumbers() { + for (let n = 0; n < numbers.length; n++) { + let totalNumbers = 0; + totalNumbers = totalNumbers + numbers[n]; + } + return totalNumbers; +} // Iteration #3.1 Bonus: function sum() {} - - // Iteration #4: Calculate the average // Level 1: Array of numbers const numbersAvg = [2, 6, 9, 10, 7, 4, 1, 9]; function averageNumbers() {} - // 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() {} // Bonus - Iteration #4.1 function avg() {} @@ -49,20 +84,25 @@ const wordsUnique = [ 'poison', 'communion', 'simple', - 'bring' + 'bring', ]; function uniquifyArray() {} - - // Iteration #6: Find elements -const wordsFind = ['machine', 'subset', 'trouble', 'starting', 'matter', 'eating', 'truth', 'disobedience']; +const wordsFind = [ + 'machine', + 'subset', + 'trouble', + 'starting', + 'matter', + 'eating', + 'truth', + 'disobedience', +]; function doesWordExist() {} - - // Iteration #7: Count repetition const wordsCount = [ 'machine', @@ -75,42 +115,79 @@ const wordsCount = [ 'matter', 'truth', 'disobedience', - 'matter' + 'matter', ]; function howManyTimes() {} - - // 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 +202,6 @@ if (typeof module !== 'undefined') { uniquifyArray, doesWordExist, howManyTimes, - greatestProduct + greatestProduct, }; } From 2d34a930a0a6b297937e072085b22befc68e6e64 Mon Sep 17 00:00:00 2001 From: shuyuan-cao Date: Thu, 1 Feb 2024 00:35:43 +0100 Subject: [PATCH 2/2] Functions and arrarys lab finished by Shuyuan --- src/functions-and-arrays.js | 82 +++++++++++++++++++++++++++++++++---- 1 file changed, 74 insertions(+), 8 deletions(-) diff --git a/src/functions-and-arrays.js b/src/functions-and-arrays.js index bf4a1ae0e..6870dcee0 100644 --- a/src/functions-and-arrays.js +++ b/src/functions-and-arrays.js @@ -37,21 +37,41 @@ function findLongestWord() { const numbers = [6, 12, 1, 18, 13, 16, 2, 1, 8, 10]; function sumNumbers() { + let totalNumbers = 0; for (let n = 0; n < numbers.length; n++) { - let totalNumbers = 0; totalNumbers = totalNumbers + numbers[n]; } return totalNumbers; } // Iteration #3.1 Bonus: -function sum() {} +function sum() { + const mixedArr = [6, 12, 'miami', 1, true, 'barca', '200', 'lisboa', 8, 10]; + let totalSum = 0; + for (const v of mixedArr) { + if (typeof v === 'string') { + totalSum += totalSum.length; + } else if (typeof v === 'number') { + totalSum += v; + } else if (typeof v === 'boolean') { + totalSum += v ? 1 : 0; + } + return totalSum; + } +} // Iteration #4: Calculate the average // Level 1: Array of numbers const numbersAvg = [2, 6, 9, 10, 7, 4, 1, 9]; -function averageNumbers() {} +function averageNumbers(arr) { + let totalNumbers = 0; + for (let num = 0; num < arr.length; num++) { + totalNumbers = totalNumbers + arr[num]; + } + let avgValue = totalNumbers / arr.length; + return avgValue; +} // Level 2: Array of strings const wordsArr = [ @@ -67,10 +87,33 @@ const wordsArr = [ 'palace', ]; -function averageWordLength() {} +function averageWordLength(arr) { + let avgLength = 0; + for (let num = 0; num < arr.length; num++) { + avgLength += arr[num].length; + } + let totalAvgLength = avgLength / arr.length; + return totalAvgLength; +} // Bonus - Iteration #4.1 -function avg() {} +const mixedArr = [6, 12, 'miami', 1, true, 'barca', '200', 'lisboa', 8, 10]; + +// should return: 5.7 +function avg(arr) { + let mixedAvg = 0; + for (let elem = 0; elem < arr.length; elem++) { + if (typeof arr[elem] === 'string') { + mixedAvg += arr[elem].length; + } else if (typeof arr[elem] === 'number') { + mixedAvg += elem; + } else if (typeof arr[elem] === 'boolean') { + mixedAvg += elem ? 1 : 0; + } + let finalMixedLength = mixedAvg / arr.length; + return finalMixedLength; + } +} // Iteration #5: Unique arrays const wordsUnique = [ @@ -87,7 +130,18 @@ const wordsUnique = [ 'bring', ]; -function uniquifyArray() {} +function uniquifyArray(arr) { + let newUniqueArrary = []; + for (let num = 0; num < arr.length; num++) { + if (newUniqueArrary.indexOf(arr[num]) === -1) { + newUniqueArrary.push(arr[num]); + } + } + return newUniqueArrary; +} + +let result = uniquifyArray(wordsUnique); +console.log(result); // Iteration #6: Find elements const wordsFind = [ @@ -101,7 +155,9 @@ const wordsFind = [ 'disobedience', ]; -function doesWordExist() {} +function doesWordExist(arr, wordForSearch) { + return arr.includes(wordForSearch); +} // Iteration #7: Count repetition const wordsCount = [ @@ -118,7 +174,17 @@ const wordsCount = [ 'matter', ]; -function howManyTimes() {} +function howManyTimes(wordArray, targetWord) { + let numToCount = 0; + + for (let w = 0; i < wordArray.length; w++) { + if (wordArray[w] === targetWord) { + numToCount++; + } + } + + return numToCount; +} // Iteration #8: Bonus const matrix = [