[WEEK07-1] 추슬기

doitchuu/BackspaceStringCompare.js

@@ -0,0 +1,22 @@
+/**
+ * @param {string} s
+ * @param {string} t
+ * @return {boolean}
+ */
+var backspaceCompare = function(s, t) {
+    return getRemainString(s) === getRemainString(t);
+};
+
+function getRemainString(str) {
+    const stack = [];
+
+    for (let i = 0; i < str.length; i++) {
+        if (str[i] === "#") {
+            stack.pop();
+        } else {
+            stack.push(str[i]);
+        }
+    }
+
+    return stack.join("");
+}

doitchuu/CountingBits.js

@@ -0,0 +1,18 @@
+/**
+ * @param {number} n
+ * @return {number[]}
+ */
+var countBits = function(n) {
+    const dp = [0];
+
+    if (n === 0) {
+        return dp;
+    }
+
+    for (let i = 1; i <= n; i++) {
+        const count = i.toString(2).replaceAll("0", "").length;
+        dp.push(count);
+    }
+
+    return dp;
+};

doitchuu/NumberOf1Bits.js

@@ -0,0 +1,15 @@
+/**
+ * @param {number} n - a positive integer
+ * @return {number}
+ */
+var hammingWeight = function(n) {
+    let current = n >>> 0;
+    let count = 0;
+
+    while (current !== 0) {
+        current &= current - 1;
+        count++;
+    }
+
+    return count;
+};

doitchuu/SameTree.js

@@ -0,0 +1,28 @@
+/**
+ * Definition for a binary tree node.
+ * function TreeNode(val, left, right) {
+ *     this.val = (val===undefined ? 0 : val)
+ *     this.left = (left===undefined ? null : left)
+ *     this.right = (right===undefined ? null : right)
+ * }
+ */
+/**
+ * @param {TreeNode} p
+ * @param {TreeNode} q
+ * @return {boolean}
+ */
+var isSameTree = function(p, q) {
+    if (p === null && q === null) {
+        return true;
+    }
+
+    if (p === null || q === null) {
+        return false;
+    }
+
+    if (p.val !== q.val) {
+        return false;
+    }
+
+    return isSameTree(p.left, q.left) && isSameTree(p.right, q.right);
+};