Skip to content
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
15 changes: 15 additions & 0 deletions sik9252/ClimbingStairs.js
Original file line number Diff line number Diff line change
@@ -0,0 +1,15 @@
/**
* @param {number} n
* @return {number}
*/
var climbStairs = function (n) {
const dp = new Array(n + 1);
dp[1] = 1;
dp[2] = 2;

for (let i = 3; i <= n; i++) {
dp[i] = dp[i - 1] + dp[i - 2];
}

return dp[n];
};
23 changes: 23 additions & 0 deletions sik9252/LongestPalindrome.js
Original file line number Diff line number Diff line change
@@ -0,0 +1,23 @@
/**
* @param {string} s
* @return {number}
*/
var longestPalindrome = function (s) {
const set = new Set();
let length = 0;

for (const char of s) {
if (set.has(char)) {
set.delete(char);
length += 2;
} else {
set.add(char);
}
}
Copy link
Member

Choose a reason for hiding this comment

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

오 Set으로 푸는 방식 너무 좋네요 👍
반복문 한번으로 해결되니 이 풀이 너무 좋은걸료


if (set.size > 0) {
length += 1;
}

return length;
};