From 612d400c36c28ea9917ac2b13b23f7fed7d73420 Mon Sep 17 00:00:00 2001
From: doo0301 <doo0301@qq.com>
Date: Wed, 12 May 2021 15:21:02 +0800
Subject: [PATCH] =?UTF-8?q?0102.=E4=BA=8C=E5=8F=89=E6=A0=91=E7=9A=84?=
 =?UTF-8?q?=E5=B1=82=E5=BA=8F=E9=81=8D=E5=8E=86.md=20=20Java?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 problems/0102.二叉树的层序遍历.md | 30 +++++++++++++++++++++++
 1 file changed, 30 insertions(+)

diff --git a/problems/0102.二叉树的层序遍历.md b/problems/0102.二叉树的层序遍历.md
index cfbe09f3..8c34d415 100644
--- a/problems/0102.二叉树的层序遍历.md
+++ b/problems/0102.二叉树的层序遍历.md
@@ -419,6 +419,36 @@ public:
 
 Java：
 
+```Java
+
+class Solution {
+    public List<List<Integer>> resList=new ArrayList<List<Integer>>();
+    public List<List<Integer>> levelOrder(TreeNode root) {
+        checkFun01(root,0);
+
+        return resList;
+    }
+
+	//递归方式
+    public void checkFun01(TreeNode node,Integer deep){
+        if(node==null) return;
+        deep++;
+
+        if(resList.size()<deep){
+            //当层级增加时，list的Item也增加，利用list的索引值进行层级界定
+            List<Integer> item=new ArrayList<Integer>();
+            resList.add(item);
+        }
+        resList.get(deep-1).add(node.val);
+        
+
+        checkFun01(node.left,deep);
+        checkFun01(node.right,deep);
+    }
+
+
+```
+
 
 Python：