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

Update 0513.找树左下角的值.md

Browse Source
This commit is contained in:
fw_qaq
2022-11-20 16:59:01 +08:00
committed by GitHub
parent 145114872d
commit 25e055ec73
1 changed files with 1 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@ -605,7 +605,7 @@ impl Solution {
while !queue.is_empty() { while !queue.is_empty() {
for i in 0..queue.len() { for i in 0..queue.len() {
let node = queue.pop_front().unwrap().unwrap(); let node = queue.pop_front().unwrap().unwrap();
if i == 1 { if i == 0 {
res = node.borrow().val; res = node.borrow().val;
} }
if node.borrow().left.is_some() { if node.borrow().left.is_some() {