Skip to content

[SAO FT6 - DE - W1D3] ALEX #587

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.

Sign up for GitHub

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

Closed
AlexChivvy wants to merge 1 commit into from
Closed

[SAO FT6 - DE - W1D3] ALEX #587

Changes from all commits
Commits
Show all changes
1 commit
Select commit
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
63 changes: 62 additions & 1 deletion js/index.js
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,7 +1,68 @@
// Iteration 1: Names and Input

let hacker1 = `Alex`;
let lengthHacker1 = hacker1.length;

console.log(`The driver's name is ${hacker1}`);

let hacker2 = `Jane`;
let lengthHacker2 = hacker2.length;

console.log(`The navigator's name is ${hacker2}`);

// Iteration 2: Conditionals

if (lengthHacker1 > lengthHacker2) {
console.log(`The driver has the longest name, it has ${lengthHacker1} characters.`)
} else if (lengthHacker2 > lengthHacker1) {
console.log(`It seems that the navigator has the longest name, it has ${lengthHacker2} characters.`)
} else {
console.log(`Wow, you both have equally long names, ${lengthHacker2} characters!`)
}

// Iteration 3: Loops


for (i = 0; i < lengthHacker1; i++){
letterHacker1 = hacker1[i];
upperCaseHacker1 = letterHacker1.toUpperCase();
console.log(`${upperCaseHacker1}`)
}

for (i = lengthHacker2; i > 0; i--){
letterHacker2 = hacker2[i-1];
console.log(`${letterHacker2}`)
}

let alphabet = `ABCDEFGHIJKLMNOPQRSTUVWXYZ`;
let minLength = Math.min(lengthHacker1,lengthHacker2);
let triggerOrderDetermined = 0;
let orderAnnouncement = `None`;


for (i = 0; i < minLength; i++){
letterHacker1 = hacker1[i];
letterHacker2 = hacker2[i];
indexHacker1 = alphabet.indexOf(letterHacker1);
indexHacker2 = alphabet.indexOf(letterHacker2);
if (triggerOrderDetermined == 0){
if (indexHacker1 < indexHacker2) {
triggerOrderDetermined = 1;
orderAnnouncement = `The driver's name goes first.`;
} else if (indexHacker1 > indexHacker2) {
triggerOrderDetermined = 1;
orderAnnouncement = `Yo, the navigator goes first definitely.`;
}
}
}
Comment on lines +43 to +57
Copy link
Copy Markdown

@heitorgodau heitorgodau Nov 28, 2019

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Para resolver isso de uma forma mais simples, estude localeCompare:
https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/String/localeCompare


let similarHacker1 = hacker1.substring(0, minLength);
let similarHacker2 = hacker2.substring(0, minLength);

if (hacker1 == hacker2){
orderAnnouncement = `What?! You both have the same name?`;
} else if (similarHacker1 == similarHacker2){
orderAnnouncement = `Your names are pretty similar...`;
}

// Iteration 3: Loops
console.log(orderAnnouncement)