zoukankan      html  css  js  c++  java
  • LeetCode 314. Binary Tree Vertical Order Traversal

    原题链接在这里:https://leetcode.com/problems/binary-tree-vertical-order-traversal/

    题目:

    Given a binary tree, return the vertical order traversal of its nodes' values. (ie, from top to bottom, column by column).

    If two nodes are in the same row and column, the order should be from left to right.

    Examples:
    Given binary tree [3,9,20,null,null,15,7],

        3
       / 
      9  20
        /  
       15   7

    return its vertical order traversal as:

    [
      [9],
      [3,15],
      [20],
      [7]
    ]
    

     Given binary tree [3,9,20,4,5,2,7],

        _3_
       /   
      9    20
     /    / 
    4   5 2   7

    return its vertical order traversal as:

    [
      [4],
      [9],
      [3,5,2],
      [20],
      [7]
    ]

    题解:

    Binary Tree Level Order Traversal类似。

    BFS, 把TreeNode和它所在的col分别放到两个queue中. dequeue后放TreeNode到对应的 colunm bucket里.

    Example of [1,2,3,4,5,6,7,8,9,10,11,12,13,14,15]. Notice that every child access changes one column bucket id. So 12 actually goes ahead of 11.

    vertical by yavinci on 500px.com

    Time Complexity: O(n). Space: O(n).

    AC Java:

     1 /**
     2  * Definition for a binary tree node.
     3  * public class TreeNode {
     4  *     int val;
     5  *     TreeNode left;
     6  *     TreeNode right;
     7  *     TreeNode(int x) { val = x; }
     8  * }
     9  */
    10 public class Solution {
    11     public List<List<Integer>> verticalOrder(TreeNode root) {
    12         List<List<Integer>> res = new ArrayList<List<Integer>>();
    13         if(root == null){
    14             return res;
    15         }
    16         HashMap<Integer, List<Integer>> colBucket = new HashMap<Integer, List<Integer>>();
    17         LinkedList<TreeNode> que = new LinkedList<TreeNode>();
    18         LinkedList<Integer> cols = new LinkedList<Integer>();
    19         int min = 0;
    20         int max = 0;
    21         
    22         que.add(root);
    23         cols.add(0);
    24         while(!que.isEmpty()){
    25             TreeNode tn = que.poll();
    26             int col = cols.poll();
    27             if(!colBucket.containsKey(col)){
    28                 colBucket.put(col, new ArrayList<Integer>());
    29             }
    30             colBucket.get(col).add(tn.val);
    31             min = Math.min(min, col);
    32             max = Math.max(max, col);
    33             
    34             if(tn.left != null){
    35                 que.add(tn.left);
    36                 cols.add(col-1);
    37             }
    38             if(tn.right != null){
    39                 que.add(tn.right);
    40                 cols.add(col+1);
    41             }
    42         }
    43         for(int i = min; i<=max; i++){
    44             res.add(colBucket.get(i));
    45         }
    46         return res;
    47     }
    48 }

    便于理解,可以吧TreeNode和它对应的column number放在一个Pair里.

    Time Complexity: O(n). Space: O(n).

    AC Java:

     1 /**
     2  * Definition for a binary tree node.
     3  * public class TreeNode {
     4  *     int val;
     5  *     TreeNode left;
     6  *     TreeNode right;
     7  *     TreeNode(int x) { val = x; }
     8  * }
     9  */
    10 public class Solution {
    11     public List<List<Integer>> verticalOrder(TreeNode root) {
    12         List<List<Integer>> res = new ArrayList<List<Integer>>();
    13         if(root == null){
    14             return res;
    15         }
    16         
    17         HashMap<Integer, List<Integer>> hm = new HashMap<Integer, List<Integer>>();
    18         LinkedList<Pair> que = new LinkedList<Pair>();
    19         que.add(new Pair(root, 0));
    20         int min = 0;
    21         int max = 0;
    22         while(!que.isEmpty()){
    23             Pair cur = que.poll();
    24             if(!hm.containsKey(cur.col)){
    25                 hm.put(cur.col, new ArrayList<Integer>());
    26             }
    27             hm.get(cur.col).add(cur.tn.val);
    28             max = Math.max(max, cur.col);
    29             min = Math.min(min, cur.col);
    30             
    31             if(cur.tn.left != null){
    32                 que.add(new Pair(cur.tn.left, cur.col-1));
    33             }
    34             if(cur.tn.right != null){
    35                 que.add(new Pair(cur.tn.right, cur.col+1));
    36             }
    37         }
    38         for(int i = min; i<=max; i++){
    39             res.add(hm.get(i));
    40         }
    41         return res;
    42     }
    43     
    44     public class Pair{
    45         TreeNode tn;
    46         int col;
    47         public Pair(TreeNode tn, int col){
    48             this.tn = tn;
    49             this.col = col;
    50         }
    51     }
    52 }

    类似Vertical Order Traversal of a Binary Tree.

  • 相关阅读:
    SqlServer:此数据库处于单用户模式,导致数据库无法删除的处理
    syscolumns表中所有字段的意思
    SQL数据库之变量
    Sqlserver常用的时间函数---GETDATE、GETUTCDATE、DATENAME
    判断游标是否存在的同时检测游标状态
    向已写好的多行插入sql语句中添加字段和值
    truncate和delete之间有什么区别
    javascript实现单例模式
    关于javascript中的 执行上下文和对象变量
    了解javascript中的this --实例篇
  • 原文地址:https://www.cnblogs.com/Dylan-Java-NYC/p/5335553.html
Copyright © 2011-2022 走看看