diff --git a/problems/0102.二叉树的层序遍历.md b/problems/0102.二叉树的层序遍历.md index 4a26d853..15d00af2 100644 --- a/problems/0102.二叉树的层序遍历.md +++ b/problems/0102.二叉树的层序遍历.md @@ -1070,8 +1070,10 @@ class Solution { return retVal; } } +``` -方法二:用一个max变量来保存最大值 +```java +//方法二:用一个max变量来保存最大值 class Solution { public List largestValues(TreeNode root) { Queue queue = new LinkedList();