-
Notifications
You must be signed in to change notification settings - Fork 5.9k
paris-christian-jeannicolas #230
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
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 |
|---|---|---|
|
|
@@ -5,3 +5,78 @@ | |
|
|
||
|
|
||
| // Lorem ipsum generator | ||
| // Names and Input | ||
| var hacker1 = "jean nicolas" | ||
| console.log("The driver's name is " + hacker1 + "."); | ||
|
|
||
| var hacker2 = prompt("What is the navigator's name?").toLowerCase(); | ||
| console.log("The navigators's name is " + hacker2 + "."); | ||
| //Conditionals | ||
|
|
||
| var hacker1Length = hacker1.length +1; | ||
| var hacker2Length = hacker2.length +1; | ||
|
|
||
| if (hacker1Length > hacker2Length) { | ||
| console.log("The Driver has the longest name, it has " + hacker1Length + " characters"); | ||
| } | ||
|
|
||
| else if (hacker2Length > hacker1Length) { | ||
| console.log("Yo, navigator got the longest name, it has " + hacker1Length + " characters"); | ||
| } | ||
|
|
||
| else if (hacker1Length === hacker2Length) { | ||
| console.log("wow, you both got equally long names, " + hacker1Length + " characters!!"); | ||
| }; | ||
|
|
||
| // Loops | ||
|
|
||
| var str1 =""; | ||
| for (var i = 0; i <= (hacker1.length - 1); i++) { | ||
| str1 += hacker1[i] + " "; | ||
| }; | ||
| console.log(str1.toUpperCase()); | ||
|
|
||
|
|
||
|
|
||
| function reverseString (str2) { | ||
| var str2; | ||
| for (var i = 0; i <= (hacker2.length - 1); i++) { | ||
| str2 += hacker2[i]; | ||
| }; | ||
|
|
||
| var splitString = str2.split("") | ||
|
|
||
| var reverseArray = splitString.reverse(); | ||
| var reverseStr = reverseArray.join(""); | ||
| console.log(reverseStr); | ||
| } | ||
|
|
||
| reverseString(); | ||
|
|
||
| // sorting names | ||
|
|
||
| var names = [hacker1, hacker2]; | ||
| names.sort(); | ||
|
|
||
| if (hacker1[0] !== hacker2[0]) { | ||
|
|
||
| if (names[0] === hacker1) { | ||
| console.log("The driver's name goes first"); | ||
| } | ||
|
|
||
| else if (names[0] === hacker2) { | ||
| console.log("Yo, the navigator goes first definitely"); | ||
| }; | ||
| } | ||
| else { | ||
| console.log("What?! You both got the same name?"); | ||
| }; | ||
|
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. In the first big if statement, to check if they have the same name, you are only comparing the first letter of each name. To be sure your code also works if there names start with the same letter but have different names, you can write your code like that : |
||
|
|
||
| // Palindrome | ||
| /* | ||
| var userPal = prompt("check if this is a palindrome:").toLowerCase(); | ||
| var reverse = userPal | ||
|
|
||
| */ | ||
| // Lorem ipsum generator | ||
|
|
||
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.
This for loop is not really needed, it is the same thing of doing :