-
Notifications
You must be signed in to change notification settings - Fork 5.8k
BCN-WDFT-ESTER-XAVI #336
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
Closed
Closed
BCN-WDFT-ESTER-XAVI #336
Changes from all commits
Commits
File filter
Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
There are no files selected for viewing
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1,7 +1,106 @@ | ||
// Names and Input | ||
let hacker1 = "Manolo"; | ||
let hacker2; | ||
let palindromeString; | ||
|
||
let driverName = ''; | ||
let driverNameRev = ''; | ||
let hack1IsLong; | ||
|
||
|
||
hacker2 = prompt("What's your name?").trim(); | ||
palindromeString = prompt('Enter a sentence').trim(); | ||
|
||
|
||
console.log("The driver's name is " + hacker1); | ||
|
||
|
||
|
||
//Conditionals | ||
|
||
|
||
// Lorem ipsum generator | ||
//Check what name is longer | ||
if (hacker1.length > hacker2.length){ | ||
console.log("The driver has the longest name, it has " + hacker1.length + " characters"); | ||
hack1IsLong = true; | ||
} else if (hacker1.length < hacker2.length){ | ||
console.log("Yo, navigator got the longest name, it has " + hacker2.length + " characters"); | ||
hack1IsLong = false; | ||
} else{ | ||
console.log("Wow, you both have equally long names, " + hacker1.length + " characters!!"); | ||
hack1IsLong = true; | ||
} | ||
|
||
//Separate characters | ||
for (let i = 0; i< hacker1.length; i++){ | ||
driverName += hacker1[i].toUpperCase() + ' '; | ||
} | ||
|
||
console.log(driverName); | ||
|
||
//Reverse the name | ||
driverNameRev = reverseString(hacker1); | ||
|
||
function reverseString(stringWords){ | ||
let reversedString = ''; | ||
for (let i = stringWords.length-1; i>= 0; i--){ | ||
reversedString += stringWords[i]; | ||
} | ||
return reversedString; | ||
} | ||
|
||
console.log(driverNameRev); | ||
|
||
|
||
//Lexicographic order | ||
if (hacker1.length > hacker2.length){ | ||
sortNames(hacker2.length, "Yo, the navigator goes first definitely"); | ||
}else if (hacker1.length < hacker2.length){ | ||
sortNames(hacker1.length, "The driver's name goes first"); | ||
} else{ | ||
sortNames(hacker1.length, "What?! You both got the same name?"); | ||
} | ||
|
||
function sortNames(lengthName, finalMessage){ | ||
for (let i = 0; i<lengthName;i++){ | ||
if (hacker1[i].toLowerCase() < hacker2[i].toLowerCase()){ | ||
console.log("The driver's name goes first"); | ||
break; | ||
} else if (hacker1[i].toLowerCase() > hacker2[i].toLowerCase()){ | ||
console.log("Yo, the navigator goes first definitely"); | ||
break; | ||
} else{ | ||
if (i === lengthName-1){ | ||
console.log(finalMessage); | ||
}else{ | ||
There was a problem hiding this comment. Choose a reason for hiding this commentThe reason will be displayed to describe this comment to others. Learn more. Al último |
||
continue; | ||
} | ||
} | ||
} | ||
} | ||
|
||
|
||
//Palindrome | ||
let palindromeAlpha = ''; | ||
|
||
for (let i=0; i<palindromeString.length; i++){ | ||
if ((palindromeString[i]>= 'A' && palindromeString[i]<= 'Z') | ||
||(palindromeString[i]>= 'a' && palindromeString[i]<= 'z')){ | ||
palindromeAlpha += palindromeString[i]; | ||
} | ||
} | ||
|
||
palindromeAlpha = palindromeAlpha.toLowerCase(); | ||
|
||
let reversedPalindrome = reverseString(palindromeAlpha); | ||
|
||
|
||
if (palindromeAlpha === reversedPalindrome){ | ||
console.log ("Is palindrome"); | ||
}else{ | ||
console.log("Is not a palindrome"); | ||
} | ||
|
||
|
||
|
||
// Lorem ipsum generator |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,12 @@ | ||
|
||
<html> | ||
<head> | ||
<script src="basic-algorithms.js"></script> | ||
</head> | ||
|
||
<body> | ||
|
||
</body> | ||
|
||
|
||
</html> |
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Como regla general: Uitlizar siempre
const
hasta que el código de error por intentar reasignar el valor.Pero buena estructura, declarando la mayoría de las variables en la parte superior.