algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-08 16:54:50 +08:00
Code Issues Packages Projects Releases Wiki Activity

Merge pull request #571 from Nixiak-nan/master

Browse Source 
Update 0513.找树左下角的值.md
This commit is contained in:
程序员Carl
2021-08-07 15:28:23 +08:00
committed by GitHub
parent 5844c23848 adddd296c5
commit a676a07e17
2 changed files with 2 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

1
problems/0236.二叉树的最近公共祖先.md
View File

@ -249,7 +249,6 @@ class Solution {
```java ```java
// 代码精简版 // 代码精简版
class Solution { class Solution {
TreeNode pre;
public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) { public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) {
if (root == null || root.val == p.val ||root.val == q.val) return root; if (root == null || root.val == p.val ||root.val == q.val) return root;
TreeNode left = lowestCommonAncestor(root.left,p,q); TreeNode left = lowestCommonAncestor(root.left,p,q);

2
problems/0513.找树左下角的值.md
View File

@ -9,6 +9,8 @@
## 513.找树左下角的值 ## 513.找树左下角的值
题目地址：[https://leetcode-cn.com/problems/find-bottom-left-tree-value/](https://leetcode-cn.com/problems/find-bottom-left-tree-value/v)
给定一个二叉树，在树的最后一行找到最左边的值。 给定一个二叉树，在树的最后一行找到最左边的值。
示例 1: 示例 1: