c*****a
发帖数: 808 | 1 怎么优化space,有报错 Run Status: Memory Limit Exceeded
本地IDE倒能跑
public class Solution {
public ArrayList> zigzagLevelOrder(TreeNode root) {
// Start typing your Java solution below
// DO NOT write main() function
ArrayList> res = new ArrayList
>();
Queue queue = new LinkedList();
queue.offer(root);
queue.offer(null);
ArrayList row = new ArrayList();
while(queue.size()>0){
TreeNode curr = queue.poll();
if(curr == null){
res.add(row);
row = new ArrayList();
if(queue.size()>0)
queue.offer(null);
}
else{
row.add(curr.val);
if(curr.right != null)
queue.offer(curr.right);
if(curr.left != null)
queue.offer(curr.left);
}
}
return res;
}
} | l**z
发帖数: 78 | 2 考虑下root==null
Integer>
【在 c*****a 的大作中提到】
: 怎么优化space,有报错 Run Status: Memory Limit Exceeded
: 本地IDE倒能跑
: public class Solution {
: public ArrayList> zigzagLevelOrder(TreeNode root) {
: // Start typing your Java solution below
: // DO NOT write main() function
: ArrayList> res = new ArrayList
: >();
: Queue queue = new LinkedList();
: queue.offer(root);
|
|
