Skip to content

lab-3-3-1 done #4233

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
wants to merge 2 commits into
base: master
Choose a base branch
from
Open
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
126 changes: 110 additions & 16 deletions src/functions-and-arrays.js
Original file line number Diff line number Diff line change
@@ -1,41 +1,91 @@
// Iteration #1: Find the maximum
function maxOfTwoNumbers() {}

function maxOfTwoNumbers(num1, num2) {
return (num1 > num2 ? num1 : num2);
}


// Iteration #2: Find longest word
const words = ['mystery', 'brother', 'aviator', 'crocodile', 'pearl', 'orchard', 'crackpot'];

function findLongestWord() {}
function findLongestWord(array) {
// let larger = "";

if (!array.length) return null;

// array.forEach(word => {
// if (word.length > larger.length)
// larger = word;
// });
// return (larger);

return (array.reduce((longest, current) =>
current.length > longest.length ? current : longest
));
}


// Iteration #3: Calculate the sum
const numbers = [6, 12, 1, 18, 13, 16, 2, 1, 8, 10];

function sumNumbers() {}
// Iteration #3.1
function sumNumbers(array) {
let sum = 0;

if (!array.length) return 0;

array.forEach(num => {
sum += num
});
return (sum);
}


// Iteration #3.2 Bonus:
const mixedArr = [6, 12, 'miami', 1, true, 'barca', '200', 'lisboa', 8, 10];

// Iteration #3.1 Bonus:
function sum() {}
function sum(array) {
let sum = 0;

array.forEach(element => {
const type = typeof element;
if (type !== 'number' && type !== 'string' && type !== 'boolean')
throw new Error(`Elemento inválido encontrado: ${element} (tipo: ${type})`);

if (type === 'number') sum += element;
else if (type === 'string') sum += element.length;
else if (type === 'boolean') sum += element ? 1 : 0;
});
return (sum);
}


// Iteration #4: Calculate the average
// Level 1: Array of numbers
const numbersAvg = [2, 6, 9, 10, 7, 4, 1, 9];

function averageNumbers() {}
function averageNumbers(array) {
if (!array.length) return (null);

const res = sumNumbers(array)/array.length;
return (res);
}


// Level 2: Array of strings
const wordsArr = ['seat', 'correspond', 'linen', 'motif', 'hole', 'smell', 'smart', 'chaos', 'fuel', 'palace'];

function averageWordLength() { }
function averageWordLength(array) {
if (!array.length) return (null);
const res = sum(array)/array.length;
return (res);
}

// Bonus - Iteration #4.1
function avg() {}
function avg(array) {
if (!array.length) return (null);
const res = sum(array)/array.length;
return (res);
}

// Iteration #5: Unique arrays
const wordsUnique = [
Expand All @@ -52,16 +102,27 @@ const wordsUnique = [
'bring'
];

function uniquifyArray() {}
function uniquifyArray(array) {
if (!array.length) return (null);

// const newArray = [];

// array.forEach(word =>
// if (!newArray.includes(word)) newArray.push(word);
// })
// return (newArray);

return ([... new Set(array)]);
}

// Iteration #6: Find elements
const wordsFind = ['machine', 'subset', 'trouble', 'starting', 'matter', 'eating', 'truth', 'disobedience'];

function doesWordExist() {}

function doesWordExist(array, word) {

if (!array.length) return (null);
return (array.includes(word));
}

// Iteration #7: Count repetition
const wordsCount = [
Expand All @@ -78,9 +139,20 @@ const wordsCount = [
'matter'
];

function howManyTimes() {}


function howManyTimes(array, word) {
if (!array.length) return (0);

// let res = 0;

// array.forEach(el => {
// if (el === word)
// res++;
// });

// return (res);

reeturn (array.filter((element) => {element === word}).length);
}

// Iteration #8: Bonus
const matrix = [
Expand All @@ -106,7 +178,29 @@ const matrix = [
[1, 70, 54, 71, 83, 51, 54, 69, 16, 92, 33, 48, 61, 43, 52, 1, 89, 19, 67, 48]
];

function greatestProduct() {}
function greatestProduct(matrix) {
if (!matrix.length) return (null);

let maxProduct = 0;

const numRows = matrix.length;
const numCols = matrix[0].length;

for (let row = 0; row < numRows; row++) {
for (let col = 0; col < numCols; col++) {

if (col + 3 < numCols) {
const horizontal = matrix[row][col] * matrix[row][col + 1] * matrix[row][col + 2] * matrix[row][col + 3];
if (horizontal > maxProduct) maxProduct = horizontal;
}
if (row + 3 < numRows) {
const vertical = matrix[row][col] * matrix[row + 1][col] * matrix[row + 2][col] * matrix[row + 3][col];
if (vertical > maxProduct) maxProduct = vertical;
}
}
}
return maxProduct;
}



Expand Down