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
8 changes: 8 additions & 0 deletions sik9252/AddBinary.js
Original file line number Diff line number Diff line change
@@ -0,0 +1,8 @@
/**
* @param {string} a
* @param {string} b
* @return {string}
*/
var addBinary = function (a, b) {
return (BigInt("0b" + a) + BigInt("0b" + b)).toString(2);
Copy link
Collaborator

Choose a reason for hiding this comment

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

오우 완전 처음보는 거네요

Copy link
Member

@doitchuu doitchuu Mar 14, 2026

Choose a reason for hiding this comment

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

그래서 parseInt로 풀면 시간 초과로 안되더라구요. BigInt로 풀이하는 방식은 처음 봤는데 데이터 구조를 잘 이용하시네요! 👍

};
21 changes: 21 additions & 0 deletions sik9252/DiameterOfBinaryTree.js
Original file line number Diff line number Diff line change
@@ -0,0 +1,21 @@
/**
* @param {TreeNode} root
* @return {number}
*/
var diameterOfBinaryTree = function (root) {
let diameter = 0;

function dfs(node) {
if (!node) return 0;

const left = dfs(node.left);
const right = dfs(node.right);

diameter = Math.max(diameter, left + right);

return Math.max(left, right) + 1;
}

dfs(root);
return diameter;
};
Loading