zoukankan      html  css  js  c++  java
  • [LeetCode] 558 Quad Tree Intersection

    A quadtree is a tree data in which each internal node has exactly four children: topLefttopRightbottomLeft and bottomRight. Quad trees are often used to partition a two-dimensional space by recursively subdividing it into four quadrants or regions.

    We want to store True/False information in our quad tree. The quad tree is used to represent a N * N boolean grid. For each node, it will be subdivided into four children nodes until the values in the region it represents are all the same. Each node has another two boolean attributes : isLeaf and valisLeaf is true if and only if the node is a leaf node. The val attribute for a leaf node contains the value of the region it represents.

    For example, below are two quad trees A and B:

    A:
    +-------+-------+   T: true
    |       |       |   F: false
    |   T   |   T   |
    |       |       |
    +-------+-------+
    |       |       |
    |   F   |   F   |
    |       |       |
    +-------+-------+
    topLeft: T
    topRight: T
    bottomLeft: F
    bottomRight: F
    
    B:               
    +-------+---+---+
    |       | F | F |
    |   T   +---+---+
    |       | T | T |
    +-------+---+---+
    |       |       |
    |   T   |   F   |
    |       |       |
    +-------+-------+
    topLeft: T
    topRight:
         topLeft: F
         topRight: F
         bottomLeft: T
         bottomRight: T
    bottomLeft: T
    bottomRight: F
    

    Your task is to implement a function that will take two quadtrees and return a quadtree that represents the logical OR (or union) of the two trees.

    A:                 B:                 C (A or B):
    +-------+-------+  +-------+---+---+  +-------+-------+
    |       |       |  |       | F | F |  |       |       |
    |   T   |   T   |  |   T   +---+---+  |   T   |   T   |
    |       |       |  |       | T | T |  |       |       |
    +-------+-------+  +-------+---+---+  +-------+-------+
    |       |       |  |       |       |  |       |       |
    |   F   |   F   |  |   T   |   F   |  |   T   |   F   |
    |       |       |  |       |       |  |       |       |
    +-------+-------+  +-------+-------+  +-------+-------+
    

    Note:

    1. Both A and B represent grids of size N * N.
    2. N is guaranteed to be a power of 2.
    3. If you want to know more about the quad tree, you can refer to its wiki.
    4. The logic OR operation is defined as this: "A or B" is true if A is true, or if B is true, or if both A and B are true.
     1 /*
     2 // Definition for a QuadTree node.
     3 class Node {
     4     public boolean val;
     5     public boolean isLeaf;
     6     public Node topLeft;
     7     public Node topRight;
     8     public Node bottomLeft;
     9     public Node bottomRight;
    10 
    11     public Node() {}
    12 
    13     public Node(boolean _val,boolean _isLeaf,Node _topLeft,Node _topRight,Node _bottomLeft,Node _bottomRight) {
    14         val = _val;
    15         isLeaf = _isLeaf;
    16         topLeft = _topLeft;
    17         topRight = _topRight;
    18         bottomLeft = _bottomLeft;
    19         bottomRight = _bottomRight;
    20     }
    21 };
    22 */
    23 class Solution {
    24     public Node intersect(Node quadTree1, Node quadTree2) {
    25         if(quadTree1 == null || quadTree2 == null) {
    26             return null;
    27         }
    28         if(quadTree1.isLeaf && quadTree2.isLeaf) {
    29             return new Node(quadTree1.val || quadTree2.val, true, null, null, null, null);
    30         }
    31         else if(quadTree1.isLeaf) {
    32             return quadTree1.val ? new Node(quadTree1.val, true, null, null, null, null) 
    33                 : new Node(quadTree2.val, quadTree2.isLeaf, quadTree2.topLeft, quadTree2.topRight, quadTree2.bottomLeft, quadTree2.bottomRight);
    34         }
    35         else if(quadTree2.isLeaf) {
    36             return quadTree2.val ? new Node(quadTree2.val, true, null, null, null, null) 
    37                 : new Node(quadTree1.val, quadTree1.isLeaf, quadTree1.topLeft, quadTree1.topRight, quadTree1.bottomLeft, quadTree1.bottomRight);            
    38         }
    39         
    40         Node topLeft = intersect(quadTree1.topLeft, quadTree2.topLeft);
    41         Node topRight = intersect(quadTree1.topRight, quadTree2.topRight);
    42         Node bottomLeft = intersect(quadTree1.bottomLeft, quadTree2.bottomLeft);
    43         Node bottomRight = intersect(quadTree1.bottomRight, quadTree2.bottomRight);
    44         
    45         Node root = new Node();
    46         if(topLeft.isLeaf && topRight.isLeaf && bottomLeft.isLeaf && bottomRight.isLeaf &&
    47            topLeft.val == topRight.val && topRight.val == bottomLeft.val && bottomLeft.val == bottomRight.val) {
    48             root.val = topLeft.val;
    49             root.isLeaf = true;            
    50         }
    51         else {
    52             root.isLeaf = false;
    53             root.topLeft = topLeft;
    54             root.topRight = topRight;
    55             root.bottomLeft = bottomLeft;
    56             root.bottomRight = bottomRight;
    57         }
    58         return root;
    59     }
    60 }
  • 相关阅读:
    内存映射函数remap_pfn_range学习——代码分析(3)
    内存映射函数remap_pfn_range学习——示例分析(2)
    内存映射函数remap_pfn_range学习——示例分析(1)
    在busybox里使用ulimit命令
    unlocked_ioctl和compat_ioctl
    使用cat读取和echo写内核文件节点的一些问题
    如何成为强大的程序员?
    如何实现“秒杀”系统
    关于博客园代码样式的调整
    Consuming a RESTful Web Service
  • 原文地址:https://www.cnblogs.com/lz87/p/9926697.html
Copyright © 2011-2022 走看看