Add solution #1022

Author: JoshCrozier

1022-sum-of-root-to-leaf-binary-numbers.js

@@ -0,0 +1,41 @@
+/**
+ * 1022. Sum of Root To Leaf Binary Numbers
+ * https://leetcode.com/problems/sum-of-root-to-leaf-binary-numbers/
+ * Difficulty: Easy
+ *
+ * You are given the root of a binary tree where each node has a value 0 or 1. Each root-to-leaf
+ * path represents a binary number starting with the most significant bit.
+ *
+ * For example, if the path is 0 -> 1 -> 1 -> 0 -> 1, then this could represent 01101 in binary,
+ * which is 13.
+ *
+ * For all leaves in the tree, consider the numbers represented by the path from the root to that
+ * leaf. Return the sum of these numbers.
+ *
+ * The test cases are generated so that the answer fits in a 32-bits integer.
+ */
+
+/**
+ * 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} root
+ * @return {number}
+ */
+var sumRootToLeaf = function(root) {
+  return dfs(root);
+};
+
+function dfs(node, str = '') {
+  if (!node) return 0;
+  str += node.val;
+  if (!node.left && !node.right) {
+    return parseInt(str, 2)
+  }
+  return dfs(node.left, str) + dfs(node.right, str);
+}

README.md

@@ -174,6 +174,7 @@
 997|[Find the Town Judge](./0997-find-the-town-judge.js)|Easy|
 1009|[Complement of Base 10 Integer](./1009-complement-of-base-10-integer.js)|Easy|
 1010|[Pairs of Songs With Total Durations Divisible by 60](./1010-pairs-of-songs-with-total-durations-divisible-by-60.js)|Medium|
+1022|[Sum of Root To Leaf Binary Numbers](./1022-sum-of-root-to-leaf-binary-numbers.js)|Easy|
 1037|[Valid Boomerang](./1037-valid-boomerang.js)|Easy|
 1041|[Robot Bounded In Circle](./1041-robot-bounded-in-circle.js)|Medium|
 1103|[Distribute Candies to People](./1103-distribute-candies-to-people.js)|Easy|