From 02e0ae17cb06a9e088a9f835807438b9e4a072ba Mon Sep 17 00:00:00 2001 From: "https://github.com/Michelineffb" Date: Wed, 15 Sep 2021 22:52:09 -0300 Subject: [PATCH 1/6] =?UTF-8?q?exerc=C3=ADcios=20do=201=20ao=205?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- .../respostas.md | 81 +++++++++++++++++++ 1 file changed, 81 insertions(+) create mode 100644 logic-exercises/d7-complexidade-de-algoritmos/respostas.md diff --git a/logic-exercises/d7-complexidade-de-algoritmos/respostas.md b/logic-exercises/d7-complexidade-de-algoritmos/respostas.md new file mode 100644 index 0000000..91cf00a --- /dev/null +++ b/logic-exercises/d7-complexidade-de-algoritmos/respostas.md @@ -0,0 +1,81 @@ +###Exercício 1 +``` +const findFirstRecurringCharacter = (input) => { + const charHashMap = {}; + for (const char of input) { + if (charHashMap[char] === true) { + return char; + } + charHashMap[char] = true; + } + return null; +}; +``` +Resposta: complexidade O(n). + + +###Exercício 2 +``` +export const func = ( + source: string, + comparison: string +): boolean => { + if ( + comparison.length > source.length + 1 || + comparison.length < source.length - 1 + ) { + return false; + } + let commonCharQuantity = 0; + + for (const char of comparison) { + if (source !== comparison) { + commonCharQuantity++; + } + } + return ( + commonCharQuantity <= source.length + 1 && + commonCharQuantity >= source.length - 1 + ); +}; +``` +Resposta: complexidade O(n). + +###Exercício 3 +``` +export const replaceMatrixValue = ( + matrix: number[][], + rowIndex: number, + columnIndex: number, + value: number +): void => { + if ( + matrix[rowIndex] === undefined || + matrix[rowIndex][columnIndex] === undefined + ) { + throw new Error("Fora do intervalo da matriz"); + } + + matrix[rowIndex][columnIndex] = value; +}; +``` +Resposta: complexidade O(1), custo 1. + + +###Exercício 4 +``` +function verifyIfExistRepeatedNumbers(listOfNumbers: number[]): boolean { + for (let i = 0; i < listOfNumbers.length; i++) { + if (listOfNumbers.indexOf(listOfNumbers[i]) !== i) { + return true; + } + } + return false; +} +``` +Resposta: complexidade O(n²), custo 1. + +###Exercício 5 +Resposta: do mais eficiente para o menos. +mais eficiente ex3 O(1), ex1 O(n), ex2 O(n), ex4 O(n²) menos eficiente + From e2408e4d8402abc3bda6b2e49af33622f6780cf1 Mon Sep 17 00:00:00 2001 From: "https://github.com/Michelineffb" Date: Mon, 20 Sep 2021 17:46:16 -0300 Subject: [PATCH 2/6] corrigindo envio de arquivos --- logic-exercises/d7-complexidade-de-algoritmos/respostas.md | 4 ---- 1 file changed, 4 deletions(-) diff --git a/logic-exercises/d7-complexidade-de-algoritmos/respostas.md b/logic-exercises/d7-complexidade-de-algoritmos/respostas.md index 91cf00a..b033d42 100644 --- a/logic-exercises/d7-complexidade-de-algoritmos/respostas.md +++ b/logic-exercises/d7-complexidade-de-algoritmos/respostas.md @@ -73,9 +73,5 @@ function verifyIfExistRepeatedNumbers(listOfNumbers: number[]): boolean { return false; } ``` -Resposta: complexidade O(n²), custo 1. -###Exercício 5 -Resposta: do mais eficiente para o menos. -mais eficiente ex3 O(1), ex1 O(n), ex2 O(n), ex4 O(n²) menos eficiente From 0fac90985aa1eec187ffe6a2053bb88498917236 Mon Sep 17 00:00:00 2001 From: "https://github.com/Michelineffb" Date: Mon, 20 Sep 2021 17:46:36 -0300 Subject: [PATCH 3/6] corrigindo envio de arquivos --- logic-exercises/d7-complexidade-de-algoritmos/respostas.md | 4 ++++ 1 file changed, 4 insertions(+) diff --git a/logic-exercises/d7-complexidade-de-algoritmos/respostas.md b/logic-exercises/d7-complexidade-de-algoritmos/respostas.md index b033d42..91cf00a 100644 --- a/logic-exercises/d7-complexidade-de-algoritmos/respostas.md +++ b/logic-exercises/d7-complexidade-de-algoritmos/respostas.md @@ -73,5 +73,9 @@ function verifyIfExistRepeatedNumbers(listOfNumbers: number[]): boolean { return false; } ``` +Resposta: complexidade O(n²), custo 1. +###Exercício 5 +Resposta: do mais eficiente para o menos. +mais eficiente ex3 O(1), ex1 O(n), ex2 O(n), ex4 O(n²) menos eficiente From e62e01336172d41c776295bf03ea5077e08f1c73 Mon Sep 17 00:00:00 2001 From: "https://github.com/Michelineffb" Date: Mon, 20 Sep 2021 20:06:24 -0300 Subject: [PATCH 4/6] corrigindo arquivos --- logic-exercises/d7-complexidade-de-algoritmos/respostas.md | 5 ----- 1 file changed, 5 deletions(-) diff --git a/logic-exercises/d7-complexidade-de-algoritmos/respostas.md b/logic-exercises/d7-complexidade-de-algoritmos/respostas.md index 91cf00a..0bc4e5d 100644 --- a/logic-exercises/d7-complexidade-de-algoritmos/respostas.md +++ b/logic-exercises/d7-complexidade-de-algoritmos/respostas.md @@ -73,9 +73,4 @@ function verifyIfExistRepeatedNumbers(listOfNumbers: number[]): boolean { return false; } ``` -Resposta: complexidade O(n²), custo 1. - -###Exercício 5 -Resposta: do mais eficiente para o menos. -mais eficiente ex3 O(1), ex1 O(n), ex2 O(n), ex4 O(n²) menos eficiente From fb107584cdcb9df643839cd650f64d0f7210dcc0 Mon Sep 17 00:00:00 2001 From: "https://github.com/Michelineffb" Date: Mon, 20 Sep 2021 20:06:51 -0300 Subject: [PATCH 5/6] corrigindo arquivos --- logic-exercises/d7-complexidade-de-algoritmos/respostas.md | 5 +++++ 1 file changed, 5 insertions(+) diff --git a/logic-exercises/d7-complexidade-de-algoritmos/respostas.md b/logic-exercises/d7-complexidade-de-algoritmos/respostas.md index 0bc4e5d..91cf00a 100644 --- a/logic-exercises/d7-complexidade-de-algoritmos/respostas.md +++ b/logic-exercises/d7-complexidade-de-algoritmos/respostas.md @@ -73,4 +73,9 @@ function verifyIfExistRepeatedNumbers(listOfNumbers: number[]): boolean { return false; } ``` +Resposta: complexidade O(n²), custo 1. + +###Exercício 5 +Resposta: do mais eficiente para o menos. +mais eficiente ex3 O(1), ex1 O(n), ex2 O(n), ex4 O(n²) menos eficiente From 9e0ff5c8ffc119bef06f82471a2c14c5bf3522da Mon Sep 17 00:00:00 2001 From: "https://github.com/Michelineffb" Date: Mon, 20 Sep 2021 20:09:16 -0300 Subject: [PATCH 6/6] corrigindo arquivos --- logic-exercises/d7-complexidade-de-algoritmos/respostas.md | 1 + 1 file changed, 1 insertion(+) diff --git a/logic-exercises/d7-complexidade-de-algoritmos/respostas.md b/logic-exercises/d7-complexidade-de-algoritmos/respostas.md index 91cf00a..279b7ed 100644 --- a/logic-exercises/d7-complexidade-de-algoritmos/respostas.md +++ b/logic-exercises/d7-complexidade-de-algoritmos/respostas.md @@ -73,6 +73,7 @@ function verifyIfExistRepeatedNumbers(listOfNumbers: number[]): boolean { return false; } ``` + Resposta: complexidade O(n²), custo 1. ###Exercício 5