Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commit 8aafc86

Browse files
update 方法二 0102.二叉树的层序遍历.md 515题java format
1 parent 0498cf3 commit 8aafc86

File tree

1 file changed

+3
-1
lines changed

1 file changed

+3
-1
lines changed

‎problems/0102.二叉树的层序遍历.md‎

Lines changed: 3 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1070,8 +1070,10 @@ class Solution {
10701070
return retVal;
10711071
}
10721072
}
1073+
```
10731074

1074-
方法二:用一个max变量来保存最大值
1075+
```java
1076+
//方法二:用一个max变量来保存最大值
10751077
class Solution {
10761078
public List<Integer> largestValues(TreeNode root) {
10771079
Queue<TreeNode> queue = new LinkedList<TreeNode>();

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /