BFS二叉树2

题目

https://leetcode-cn.com/problems/binary-tree-level-order-traversal/

解法

public List<List<Integer>> levelOrder(TreeNode root) {
    Queue<TreeNode> queue = new LinkedList<>();
    List<List<Integer>> res = new ArrayList<>();
    if (root != null) queue.add(root);
    while (!queue.isEmpty()) {
        List<Integer> tmp = new ArrayList<>();
        for (int i=queue.size(); i>0; i--) {
            TreeNode node = queue.poll();
            tmp.add(node.val);
            if (node.left != null) queue.add(node.left);
            if (node.right != null) queue.add(node.right);
        }
        res.add(tmp);
    }
    return res;
}

2020-07-06

LC63_uniquePathsWithObstacles

BFS二叉树2

题目

解法

Links

Categorias

Nube de etiquetas

Recientes

Archivos

Etiquetas

Recientes

Archivos

Etiquetas

Your browser is out-of-date!