Skip to content

[HerrineKim] Week 2 #754

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 3 commits into from
Dec 21, 2024
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
18 changes: 18 additions & 0 deletions climbing-stairs/HerrineKim.js
Original file line number Diff line number Diff line change
@@ -0,0 +1,18 @@
// 시간복잡도: O(n)
// 공간복잡도: O(1)

/**
* @param {number} n
* @return {number}
*/
var climbStairs = function (n) {
if (n <= 2) return n;
let prev1 = 1, prev2 = 2;
for (let i = 3; i <= n; i++) {
let curr = prev1 + prev2;
prev1 = prev2;
prev2 = curr;
}
return prev2;
};

27 changes: 27 additions & 0 deletions decode-ways/HerrineKim.js
Original file line number Diff line number Diff line change
@@ -0,0 +1,27 @@
// 시간복잡도: O(n)
// 공간복잡도: O(n)

/**
* @param {string} s
* @return {number}
*/
var numDecodings = function (s) {
const memo = {};

const helper = (index) => {
if (index === s.length) return 1;
if (s[index] === '0') return 0;
Comment on lines +12 to +13
Copy link
Contributor

Choose a reason for hiding this comment

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

개인적으로 이 early return 조건문들은 재귀 호출과 독립적으로 동작할 수 있는 조건들이기 때문에, helper 클로져 밖에 있는게 좋을 것 같습니다

if (memo[index] !== undefined) return memo[index];

let ways = helper(index + 1);
if (index < s.length - 1 && parseInt(s.slice(index, index + 2)) <= 26) {
ways += helper(index + 2);
}

memo[index] = ways;
return ways;
};

return helper(0);
};

27 changes: 27 additions & 0 deletions valid-anagram/HerrineKim.js
Original file line number Diff line number Diff line change
@@ -0,0 +1,27 @@
// 시간복잡도: O(n)
// 공간복잡도: O(1)

/**
* @param {string} s
* @param {string} t
* @return {boolean}
*/
var isAnagram = function (s, t) {
if (s.length !== t.length) return false;

const charCount = {};

for (const char of s) {
charCount[char] = (charCount[char] || 0) + 1;
}

for (const char of t) {
if (!charCount[char]) {
return false;
}
charCount[char]--;
}

return true;
};

Loading