Skip to content
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 2 commits into from
Jan 12, 2025
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
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
24 changes: 24 additions & 0 deletions best-time-to-buy-and-sell-stock/limlimjo.js
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)
21 changes: 21 additions & 0 deletions group-anagrams/limlimjo.js
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) {
// 정렬된 단어
Copy link
Contributor

Choose a reason for hiding this comment

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

중요하지 않은 사항입니다.
6, 9, 11 라인 등등 작성해주신 불필요한 주석이 일부 포함된것 같아 보여요.

const sortWord = str.split("").sort().join("");
// map에 가지고 있지 않을 때
if (!map.has(sortWord)) {
map.set(sortWord, []);
}
map.get(sortWord).push(str);
}

return Array.from(map.values());
};
Loading