andreamatsunaga/challenge-algorithms-v2.0-andrea-matsunaga
1
0
Fork 0
forked from M3-Academy/challenge-algorithms-v2.0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

refactor: padroniza formatação do código #2

Merged
andreamatsunaga merged 1 commits from development into master 2022-11-01 17:38:59 +00:00
Conversation 0 Commits 1 Files Changed 3 +12 -12
3 changed files with 12 additions and 12 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

11
05-isPrime/index.js
View File

@ -1,10 +1,11 @@
export function isPrime(value) { export function isPrime(value) {
if (value <= 1) return false; if (value <= 1) return false;
for (let divisor = 2; divisor <= Math.sqrt(value); divisor++) { let valueSqrt = Math.sqrt(value);
if (value % divisor === 0) {
return false for (let divisor = 2; divisor <= valueSqrt; divisor++) {
} if (value % divisor === 0) return false;
} }
return true
return true;
} }

6
08-isAnagram/index.js
View File

@ -1,8 +1,8 @@
export function isAnagram(word1, word2) { export function isAnagram(word1, word2) {
if (word1.length != word2.length) return false if (word1.length != word2.length) return false;
let sortedWord1Array = [...word1.toLowerCase()].sort() let sortedWord1Array = [...word1.toLowerCase()].sort();
let sortedWord2Array = [...word2.toLowerCase()].sort() let sortedWord2Array = [...word2.toLowerCase()].sort();
return (sortedWord1Array.join('') === sortedWord2Array.join('')); return (sortedWord1Array.join('') === sortedWord2Array.join(''));
} }

7
10-longestWords/index.js
View File

@ -1,12 +1,11 @@
export function longestWords(words) { export function longestWords(words) {
let sortedWords = words.sort((a, b) => b.length - a.length); let sortedWords = words.sort((a, b) => b.length - a.length);
let maxLength = sortedWords[0].length let maxLength = sortedWords[0].length;
let longestWords = [] let longestWords = [];
for (let word of sortedWords) { for (let word of sortedWords) {
if(word.length != maxLength) break; if(word.length != maxLength) break;
longestWords.push(word) longestWords.push(word);
} }
return longestWords; return longestWords;