Skip to content

[moonjonghoo] Week 05 Solutions #1400

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

Open
wants to merge 3 commits into
base: main
Choose a base branch
from
Open
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/moonjonghoo.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 minPrices = Infinity;
let profit = 0;
for (price of prices) {
minPrices = Math.min(price, minPrices);
profit = Math.max(profit, price - minPrices);
}
return profit;
};

var maxProfit = function (prices) {
let maxProfit = 0;
let currentProfit = 0;
for (let i = 1; i < prices.length; i++) {
let diff = prices[i] - prices[i - 1];
currentProfit = Math.max(0, currentProfit + diff);
maxProfit = Math.max(maxProfit, currentProfit);
}
return maxProfit;
};
22 changes: 22 additions & 0 deletions group-anagrams/moonjonghoo.js
Original file line number Diff line number Diff line change
@@ -0,0 +1,22 @@
/**
* @param {string[]} strs
* @return {string[][]}
*/
var groupAnagrams = function (strs) {
let hashMap = new Map();
for (let i = 0; i < strs.length; i++) {
let key = strs[i].split("").sort().join("");
if (!hashMap.has(key)) {
hashMap.set(key, [strs[i]]);
} else {
hashMap.set(key, [...hashMap.get(key), strs[i]]);
}
}
let answer = [];
for ([key, value] of hashMap) {
answer.push(value);
}
return answer.sort((a, b) => a.length - b.length).map((arr) => arr.sort());
};

console.log(groupAnagrams(["eat", "tea", "tan", "ate", "nat", "bat"]));
31 changes: 31 additions & 0 deletions word-break/moonjonghoo.js
Original file line number Diff line number Diff line change
@@ -0,0 +1,31 @@
/**
* @param {string} s
* @param {string[]} wordDict
* @return {boolean}
*/
var wordBreak = function (s, wordDict) {
const memo = new Map(); // 실패/성공 여부 기억
const wordSet = new Set(wordDict); // lookup 최적화

function canBreak(sub) {
if (sub === "") return true;

if (memo.has(sub)) return memo.get(sub);

for (let i = 1; i <= sub.length; i++) {
const prefix = sub.slice(0, i);
if (wordSet.has(prefix)) {
const suffix = sub.slice(i);
if (canBreak(suffix)) {
memo.set(sub, true);
return true;
}
}
}

memo.set(sub, false); // 실패한 경우도 기억
return false;
}

return canBreak(s);
};