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

bugfix: declara i e transforma string em booleano

Browse Source
This commit is contained in:
Vinicius 2022-11-08 18:34:51 -02:00
parent 97e2b39b67
commit 3c9a57e29d
3 changed files with 7 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

1
04-fibonacci/index.js
View File

@ -1,6 +1,7 @@
export function fibonacci(value) { export function fibonacci(value) {
// implementar logica aqui // implementar logica aqui
let f = []; let f = [];
let n = 2;
f[0] = 0; f[0] = 0;
f[1] = 1; f[1] = 1;
for (n = 2; n <= value; n++) { for (n = 2; n <= value; n++) {

4
05-isPrime/index.js
View File

@ -18,8 +18,8 @@ export function isPrime(value) {
value % 7 != 0 && value % 7 != 0 &&
value % 11 != 0 && value % 11 != 0 &&
value % 13 != 0 value % 13 != 0
? "true" ? true
: "false"; : false;
} }
return primo; return primo;
} }

7
08-isAnagram/index.js
View File

@ -3,15 +3,16 @@ export function isAnagram(word1, word2) {
let par_1 = word1.toLowerCase().split("").sort(); let par_1 = word1.toLowerCase().split("").sort();
let par_2 = word2.toLowerCase().split("").sort(); let par_2 = word2.toLowerCase().split("").sort();
let final; let final;
let i = 0;
if (par_1.length != par_2.length) { if (par_1.length != par_2.length) {
final = "false"; final = false;
} else { } else {
for (i in par_1) { for (i in par_1) {
if (par_1[i] != par_2[i]) { if (par_1[i] != par_2[i]) {
final = "false"; final = false;
break; break;
} else { } else {
final = "true"; final = true;
} }
} }
} }