Team B Application #24
Open
Conversation
This file contains 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
In my code, I defined the whole thing as a function. First, I check for the cases where there is less than 2 days/stock prices or if the max price is after the min price. Then if the scenario is very complicated, I use a nested for loop to go over the whole array to compare from right number to left number and by subtracting the right by left numbers. From this we compare the values and find the max value possible from all the possible profit values and return the highest value.
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
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.
CS Games 2023 Team B Application
PLEASE FILL IN THE FOLLOWING!
Full Name
Justin Zheng
UWindsor Email
[email protected]
Application Form
Briefly explain how your solution works and how to run it
In my code, I defined the whole thing as a function. First, I check for the cases where there is less than 2 days/stock prices or if the max price is after the min price. Then if the scenario is very complicated, I use a nested for loop to go over the whole array to compare from right number to left number and by subtracting the right by left numbers. From this we compare the values and find the max value possible from all the possible profit values and return the highest value.