雷布斯:说唱新星# PDA - 掌中宝
f*c
1 楼
这题试了好几个办法总是通不过,按说不难的,求帮忙看看,谢谢!
public class Solution {
public List
public class Solution {
public List
- > levelOrder(TreeNode root) {
List
- > result = new ArrayList
- >();
if(root == null) return result;
Queue
current level TreeNode
current.add(root);
List
elements in current level
while(!current.isEmpty()) {
Queue
while(!current.isEmpty()) {
TreeNode curr = current.remove();
levelValue.add(curr.val);
if(curr.left != null) nextLevel.add(curr.left);
if(curr.right != null) nextLevel.add(curr.right);
}
current.addAll(nextLevel);
result.add(levelValue);
levelValue.clear();
}
return result;
}
}