Skip to content

[kimyoung] WEEK 05 Solutions #443

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.

Sign up for GitHub

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 1 commit into from
Sep 14, 2024
Merged

[kimyoung] WEEK 05 Solutions #443

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
21 changes: 21 additions & 0 deletions best-time-to-buy-and-sell-stock/kimyoung.js
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,21 @@
/**
* @param {number[]} prices
* @return {number}
*/
var maxProfit = function(prices) {
let left = 0, right = 1;
let max = 0;

while(right < prices.length) {
Copy link
Contributor

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

비슷한 풀이여도 left, right로 두고 반복문을 진행하니까

문제를 새로운 이미지로 떠올리게 되네요 :D

if(prices[right] < prices[left]) {
left = right;
} else {
max = Math.max(max, prices[right] - prices[left]);
}
right++;
}
return max;
};

// time - O(n) iterate through prices once
// space - O(1)