forked from AdaGold/js-adagrams
-
Notifications
You must be signed in to change notification settings - Fork 20
AC2 Ocelots Sheung Wan (Melody) Wong #20
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
Open
MelodyW2022
wants to merge
7
commits into
ada-ac2:main
Choose a base branch
from
MelodyW2022:main
base: main
Could not load branches
Branch not found: {{ refName }}
Loading
Could not load tags
Nothing to show
Loading
Are you sure you want to change the base?
Some commits from the old base branch may be removed from the timeline,
and old review comments may become outdated.
Open
Changes from all commits
Commits
Show all changes
7 commits
Select commit
Hold shift + click to select a range
2680c54
wave01 completed
MelodyW2022 8b11630
remove comments
MelodyW2022 d189ae0
wave02 completed
MelodyW2022 188e204
put LETTER_POOL in global scope
MelodyW2022 3f4653f
wave03 and tests for wave03 completed
MelodyW2022 8f535b5
wave04 and tests for wave04 completed
MelodyW2022 c02ce42
installing Jest Extension for VS Code
MelodyW2022 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 |
|---|---|---|
| @@ -0,0 +1,24 @@ | ||
| { | ||
| "configurations": [ | ||
|
|
||
| { | ||
| "type": "node", | ||
| "name": "vscode-jest-tests.v2", | ||
| "request": "launch", | ||
| "args": [ | ||
| "test", | ||
| "--runInBand", | ||
| "--watchAll=false", | ||
| "--testNamePattern", | ||
| "${jest.testNamePattern}", | ||
| "--runTestsByPath", | ||
| "${jest.testFile}" | ||
| ], | ||
| "cwd": "/Users/sheungwanwong/Documents/Ada_Developers_Academy/Ada_AC2/projects/js-adagrams", | ||
| "console": "integratedTerminal", | ||
| "internalConsoleOptions": "neverOpen", | ||
| "disableOptimisticBPs": true, | ||
| "runtimeExecutable": "yarn" | ||
| } | ||
| ] | ||
| } |
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 @@ | ||
| {} |
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
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,15 +1,118 @@ | ||
| const LETTER_POOL = { | ||
| A: 9, | ||
| B: 2, | ||
| C: 2, | ||
| D: 4, | ||
| E: 12, | ||
| F: 2, | ||
| G: 3, | ||
| H: 2, | ||
| I: 9, | ||
| J: 1, | ||
| K: 1, | ||
| L: 4, | ||
| M: 2, | ||
| N: 6, | ||
| O: 8, | ||
| P: 2, | ||
| Q: 1, | ||
| R: 6, | ||
| S: 4, | ||
| T: 6, | ||
| U: 4, | ||
| V: 2, | ||
| W: 2, | ||
| X: 1, | ||
| Y: 2, | ||
| Z: 1, | ||
| }; | ||
|
|
||
| const LETTER_VALUES = { | ||
| A: 1, | ||
| B: 3, | ||
| C: 3, | ||
| D: 2, | ||
| E: 1, | ||
| F: 4, | ||
| G: 2, | ||
| H: 4, | ||
| I: 1, | ||
| J: 8, | ||
| K: 5, | ||
| L: 1, | ||
| M: 3, | ||
| N: 1, | ||
| O: 1, | ||
| P: 2, | ||
| Q: 10, | ||
| R: 1, | ||
| S: 1, | ||
| T: 1, | ||
| U: 1, | ||
| V: 4, | ||
| W: 4, | ||
| X: 8, | ||
| Y: 4, | ||
| Z: 10, | ||
| }; | ||
|
|
||
| export const drawLetters = () => { | ||
| // Implement this method for wave 1 | ||
| const LETTER_CLONE = { ...LETTER_POOL }; | ||
| const letters = Object.keys(LETTER_CLONE); | ||
| const res = []; | ||
|
|
||
| while (res.length < 10) { | ||
| let letter = letters[Math.floor(Math.random() * letters.length)]; | ||
| if (LETTER_CLONE[letter] > 0) { | ||
| res.push(letter); | ||
| LETTER_CLONE[letter]--; | ||
| } | ||
| } | ||
| return res; | ||
| }; | ||
|
|
||
| export const usesAvailableLetters = (input, lettersInHand) => { | ||
| // Implement this method for wave 2 | ||
| const lettersInHandClone = [...lettersInHand]; | ||
| for (const letter of input) { | ||
| const i = lettersInHandClone.indexOf(letter); | ||
| if (i !== -1) { | ||
|
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. Okay, I like how you did this :) |
||
| lettersInHandClone.splice(i, 1); | ||
| } else { | ||
| return false; | ||
| } | ||
| } | ||
| return true; | ||
| }; | ||
|
|
||
| export const scoreWord = (word) => { | ||
| // Implement this method for wave 3 | ||
| let score = 0; | ||
| for (const letter of word) { | ||
| score += LETTER_VALUES[letter.toUpperCase()]; | ||
| } | ||
| if (word.length >= 7 && word.length <= 10) { | ||
| score += 8; | ||
| } | ||
| return score; | ||
| }; | ||
|
|
||
| export const highestScoreFrom = (words) => { | ||
| // Implement this method for wave 4 | ||
| let winner = { | ||
| word: words[0], | ||
| score: 0, | ||
| }; | ||
| for (const word of words) { | ||
| let score = scoreWord(word); | ||
| if (score > winner.score) { | ||
| winner = { word, score }; | ||
| } else if (score === winner.score) { | ||
| if (winner.word.length === 10) { | ||
| //pass | ||
| } else if (word.length === 10 && winner.word.length !== 10) { | ||
| winner = { word, score }; | ||
| } else if (word.length < winner.word.length) { | ||
| winner = { word, score }; | ||
| } | ||
| } | ||
| } | ||
| return winner; | ||
| }; | ||
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
Oops, something went wrong.
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 loop makes sense to me