-
-
Notifications
You must be signed in to change notification settings - Fork 245
[Wan] Week 5 #859
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
Merged
Merged
[Wan] Week 5 #859
Changes from 1 commit
Commits
Show all changes
4 commits
Select commit
Hold shift + click to select a range
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,29 @@ | ||
/** | ||
* 121. Best Time to Buy and Sell Stock | ||
* You are given an array prices where prices[i] is the price of a given stock on the ith day. | ||
* You want to maximize your profit by choosing a single day to buy one stock and choosing a different day in the future to sell that stock. | ||
* Return the maximum profit you can achieve from this transaction. If you cannot achieve any profit, return 0. | ||
* | ||
* https://leetcode.com/problems/best-time-to-buy-and-sell-stock/description/ | ||
*/ | ||
|
||
// O(n) time | ||
// O(n) space | ||
function maxProfit(prices: number[]): number { | ||
let highestProfit = 0; | ||
let left = 0; | ||
let right = 1; | ||
|
||
while (right < prices.length) { | ||
if (prices[left] < prices[right]) { | ||
let profit = prices[right] - prices[left]; | ||
highestProfit = Math.max(highestProfit, profit); | ||
} else { | ||
left = right; | ||
} | ||
|
||
right++; | ||
} | ||
|
||
return highestProfit; | ||
} |
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.
사용하는 변수는 highestProfit, left, right 3개로, 입력값의 크기와 관계없이 메모리 사용량이 일정하므로
공간 복잡도는 O(1)이 되지 않을까요?
Uh oh!
There was an error while loading. Please reload this page.
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.
아 그렇네요. 확인 감사합니다~