标签：区域 otto 递归 相同 属性 提示 节点 tree node wiki
四叉树是一种树数据，其中每个结点恰好有四个子结点：topLeft、topRight、bottomLeft 和 bottomRight。四叉树通常被用来划分一个二维空间，递归地将其细分为四个象限或区域。
我们希望在四叉树中存储 True/False 信息。四叉树用来表示 N * N 的布尔网格。对于每个结点, 它将被等分成四个孩子结点直到这个区域内的值都是相同的。每个节点都有另外两个布尔属性：isLeaf 和 isLeaf。当这个节点是一个叶子结点时 isLeaf 为真。val 变量储存叶子结点所代表的区域的值。
例如，下面是两个四叉树 A 和 B：
你的任务是实现一个函数，该函数根据两个四叉树返回表示这两个四叉树的逻辑或(或并)的四叉树。
提示：
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 }
标签：区域 otto 递归 相同 属性 提示 节点 tree node wiki
原文地址：https://www.cnblogs.com/kexinxin/p/10373990.html
