feat: add solutions to lc problem: No.0513. Find Bottom Left Tree Value

Author: yanglbme

README.md

@@ -195,7 +195,9 @@
 
 ## 维护者
 
-[Yang Libin](https://github.com/yanglbme): 开源社区 @Doocs 创建者「[GitHub](https://github.com/doocs) / [Gitee](https://gitee.com/doocs)」；GitHub 开源组织 [@TheAlgorithms](https://github.com/TheAlgorithms) 成员。
+- [Yang Libin](https://github.com/yanglbme)
+- [Mao Longlong](https://github.com/MaoLongLong)
+
 
 ## 加入我们
 

README_EN.md

@@ -188,7 +188,8 @@ Complete solutions to [LeetCode](https://leetcode-cn.com/problemset/all/), [LCOF
 
 ## Maintainer
 
-[Yang Libin](https://github.com/yanglbme): Creator of [@Doocs](https://github.com/doocs) organization; member of [@TheAlgorithms](https://github.com/TheAlgorithms) organization.
+- [Yang Libin](https://github.com/yanglbme)
+- [Mao Longlong](https://github.com/MaoLongLong)
 
 ## Contributions
 

solution/0500-0599/0513.Find Bottom Left Tree Value/README.md

@@ -44,27 +44,81 @@
 
 <p><strong>注意:</strong> 您可以假设树（即给定的根节点）不为 <strong>NULL</strong>。</p>
 
-
 ## 解法
 
 <!-- 这里可写通用的实现逻辑 -->
 
+“BFS 层次遍历”实现。
+
 <!-- tabs:start -->
 
 ### **Python3**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+# 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 findBottomLeftValue(self, root: TreeNode) -> int:
+        res = 0
+        q = collections.deque([root])
+        while q:
+            res = q[0].val
+            n = len(q)
+            for _ in range(n):
+                node = q.popleft()
+                if node.left:
+                    q.append(node.left)
+                if node.right:
+                    q.append(node.right)
+        return res
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
-
+/**
+ * Definition for a binary tree node.
+ * public class TreeNode {
+ *     int val;
+ *     TreeNode left;
+ *     TreeNode right;
+ *     TreeNode() {}
+ *     TreeNode(int val) { this.val = val; }
+ *     TreeNode(int val, TreeNode left, TreeNode right) {
+ *         this.val = val;
+ *         this.left = left;
+ *         this.right = right;
+ *     }
+ * }
+ */
+class Solution {
+    public int findBottomLeftValue(TreeNode root) {
+        Deque<TreeNode> q = new ArrayDeque<>();
+        q.offer(root);
+        int res = 0;
+        while (!q.isEmpty()) {
+            res = q.peek().val;
+            for (int i = 0, n = q.size(); i < n; ++i) {
+                TreeNode node = q.poll();
+                if (node.left != null) {
+                    q.offer(node.left);
+                }
+                if (node.right != null) {
+                    q.offer(node.right);
+                }
+            }
+        }
+        return res;
+    }
+}
 ```
 
 ### **...**

solution/0500-0599/0513.Find Bottom Left Tree Value/README_EN.md

@@ -29,21 +29,73 @@
 	<li><code>-2<sup>31</sup> &lt;= Node.val &lt;= 2<sup>31</sup> - 1</code></li>
 </ul>
 
-
 ## Solutions
 
 <!-- tabs:start -->
 
 ### **Python3**
 
 ```python
-
+# 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 findBottomLeftValue(self, root: TreeNode) -> int:
+        res = 0
+        q = collections.deque([root])
+        while q:
+            res = q[0].val
+            n = len(q)
+            for _ in range(n):
+                node = q.popleft()
+                if node.left:
+                    q.append(node.left)
+                if node.right:
+                    q.append(node.right)
+        return res
 ```
 
 ### **Java**
 
 ```java
-
+/**
+ * Definition for a binary tree node.
+ * public class TreeNode {
+ *     int val;
+ *     TreeNode left;
+ *     TreeNode right;
+ *     TreeNode() {}
+ *     TreeNode(int val) { this.val = val; }
+ *     TreeNode(int val, TreeNode left, TreeNode right) {
+ *         this.val = val;
+ *         this.left = left;
+ *         this.right = right;
+ *     }
+ * }
+ */
+class Solution {
+    public int findBottomLeftValue(TreeNode root) {
+        Deque<TreeNode> q = new ArrayDeque<>();
+        q.offer(root);
+        int res = 0;
+        while (!q.isEmpty()) {
+            res = q.peek().val;
+            for (int i = 0, n = q.size(); i < n; ++i) {
+                TreeNode node = q.poll();
+                if (node.left != null) {
+                    q.offer(node.left);
+                }
+                if (node.right != null) {
+                    q.offer(node.right);
+                }
+            }
+        }
+        return res;
+    }
+}
 ```
 
 ### **...**

solution/0500-0599/0513.Find Bottom Left Tree Value/Solution.java

@@ -1,31 +1,35 @@
 /**
  * Definition for a binary tree node.
  * public class TreeNode {
- * int val;
- * TreeNode left;
- * TreeNode right;
- * TreeNode(int x) { val = x; }
+ *     int val;
+ *     TreeNode left;
+ *     TreeNode right;
+ *     TreeNode() {}
+ *     TreeNode(int val) { this.val = val; }
+ *     TreeNode(int val, TreeNode left, TreeNode right) {
+ *         this.val = val;
+ *         this.left = left;
+ *         this.right = right;
+ *     }
  * }
  */
 class Solution {
-    int max = -1;
-    int value = 0;
-
     public int findBottomLeftValue(TreeNode root) {
-        dfs(root, 0);
-        return value;
-    }
-
-    private void dfs(TreeNode root, int d) {
-        if (root == null) {
-            return;
-        }
-        d++;
-        if (max < d) {
-            max = d;
-            value = root.val;
+        Deque<TreeNode> q = new ArrayDeque<>();
+        q.offer(root);
+        int res = 0;
+        while (!q.isEmpty()) {
+            res = q.peek().val;
+            for (int i = 0, n = q.size(); i < n; ++i) {
+                TreeNode node = q.poll();
+                if (node.left != null) {
+                    q.offer(node.left);
+                }
+                if (node.right != null) {
+                    q.offer(node.right);
+                }
+            }
         }
-        dfs(root.left, d);
-        dfs(root.right, d);
+        return res;
     }
 }

solution/0500-0599/0513.Find Bottom Left Tree Value/Solution.py

@@ -0,0 +1,20 @@
+# 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 findBottomLeftValue(self, root: TreeNode) -> int:
+        res = 0
+        q = collections.deque([root])
+        while q:
+            res = q[0].val
+            n = len(q)
+            for _ in range(n):
+                node = q.popleft()
+                if node.left:
+                    q.append(node.left)
+                if node.right:
+                    q.append(node.right)
+        return res