leetcode: finished #1022

content/leetcode/2024/2.md

@@ -3,6 +3,38 @@ title: 2024.2
 draft: false
 ---
 
+# 2024.2.7
+
+```python
+#
+# @lc app=leetcode.cn id=1022 lang=python3
+#
+# [1022] 从根到叶的二进制数之和
+#
+
+# @lc code=start
+# Definition for a binary tree node.
+# class TreeNode:
+#     def __init__(self, val=0, left=None, right=None):
+#         self.val = val
+#         self.left = left
+#         self.right = right
+class Solution:
+    def sumRootToLeaf(self, root: Optional[TreeNode]) -> int:
+        def dfs(node, val):
+            if not node:
+                return 0
+            val = val * 2 + node.val
+            if not node.left and not node.right:
+                return val
+            return dfs(node.left, val) + dfs(node.right, val)
+
+        return dfs(root, 0)
+
+
+# @lc code=end
+```
+
 # 2024.2.6
 
 ```python