-
Notifications
You must be signed in to change notification settings - Fork 126
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
[jj7779607] Week5 #868
Merged
Merged
[jj7779607] Week5 #868
Changes from all commits
Commits
Show all changes
2 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 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 @@ | ||
/** | ||
* @param {number[]} prices | ||
* @return {number} | ||
*/ | ||
var maxProfit = function(prices) { | ||
|
||
// 최대 수익 | ||
let maxProfit = 0; | ||
// prices 배열의 0번째를 최소 가격으로 시작 | ||
let minPrice = prices[0]; | ||
|
||
// prices 배열 for문 돌려서 최대 수익 찾기 | ||
for(let i=0; i<prices.length; i++) { | ||
minPrice = Math.min(minPrice, prices[i]); | ||
let current = prices[i] - minPrice; | ||
maxProfit = Math.max(current, maxProfit); | ||
} | ||
// 최대 수익 반환 | ||
return maxProfit; | ||
|
||
}; | ||
|
||
// 시간 복잡도: O(n) | ||
// 공간 복잡도: O(1) |
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
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,21 @@ | ||
/** | ||
* @param {string[]} strs | ||
* @return {string[][]} | ||
*/ | ||
var groupAnagrams = function (strs) { | ||
// map에 담기 | ||
const map = new Map(); | ||
|
||
// for문 돌기 | ||
for (const str of strs) { | ||
// 정렬된 단어 | ||
const sortWord = str.split("").sort().join(""); | ||
// map에 가지고 있지 않을 때 | ||
if (!map.has(sortWord)) { | ||
map.set(sortWord, []); | ||
} | ||
map.get(sortWord).push(str); | ||
} | ||
|
||
return Array.from(map.values()); | ||
}; |
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.
중요하지 않은 사항입니다.
6, 9, 11 라인 등등 작성해주신 불필요한 주석이 일부 포함된것 같아 보여요.