Solve problem Quad Tree Intersection

Author: P-ppc

README.md

@@ -217,6 +217,7 @@ All solutions will be accepted!
 |872|[Leaf Similar Trees](https://leetcode-cn.com/problems/leaf-similar-trees/description/)|[java/py/js](./algorithms/LeafSimilarTrees)|Easy|
 |427|[Construct Quad Tree](https://leetcode-cn.com/problems/construct-quad-tree/description/)|[java/py](./algorithms/ConstructQuadTree)|Easy|
 |458|[Poor Pigs](https://leetcode-cn.com/problems/poor-pigs/description/)|[java/py/js](./algorithms/PoorPigs)|Easy|
+|558|[Quad Tree Intersection](https://leetcode-cn.com/problems/quad-tree-intersection/description/)|[java/py](./algorithms/QuadTreeIntersection)|Easy|
 
 # Database
 |#|Title|Solution|Difficulty|

algorithms/QuadTreeIntersection/README.md

@@ -0,0 +1,2 @@
+# Quad Tree Intersection
+This problem is easy to solve by recursive

algorithms/QuadTreeIntersection/Solution.java

@@ -0,0 +1,57 @@
+/*
+// Definition for a QuadTree node.
+class Node {
+    public boolean val;
+    public boolean isLeaf;
+    public Node topLeft;
+    public Node topRight;
+    public Node bottomLeft;
+    public Node bottomRight;
+
+    public Node() {}
+
+    public Node(boolean _val,boolean _isLeaf,Node _topLeft,Node _topRight,Node _bottomLeft,Node _bottomRight) {
+        val = _val;
+        isLeaf = _isLeaf;
+        topLeft = _topLeft;
+        topRight = _topRight;
+        bottomLeft = _bottomLeft;
+        bottomRight = _bottomRight;
+    }
+};
+*/
+class Solution {
+    public Node intersect(Node quadTree1, Node quadTree2) {
+        if (quadTree1.isLeaf && quadTree2.isLeaf) {
+            return new Node(quadTree1.val || quadTree2.val, true, null, null, null, null);
+        } else if (!quadTree1.isLeaf && !quadTree2.isLeaf) {
+            Node topLeft = intersect(quadTree1.topLeft, quadTree2.topLeft),
+                 topRight = intersect(quadTree1.topRight, quadTree2.topRight),
+                 bottomLeft = intersect(quadTree1.bottomLeft, quadTree2.bottomLeft),
+                 bottomRight = intersect(quadTree1.bottomRight, quadTree2.bottomRight);
+            
+            boolean val = topLeft.val;
+            boolean isLeaf = topLeft.isLeaf && topRight.isLeaf && bottomLeft.isLeaf && bottomRight.isLeaf &&
+                             val == topRight.val && val == bottomLeft.val && val == bottomRight.val;
+            return new Node(
+                val,
+                isLeaf,
+                isLeaf ? null : topLeft,
+                isLeaf ? null : topRight,
+                isLeaf ? null : bottomLeft,
+                isLeaf ? null : bottomRight
+            );
+        } else {
+            Node node = quadTree1.isLeaf ? quadTree1 : quadTree2,
+                 node1 = quadTree1.isLeaf ? quadTree2 : quadTree1;
+            return new Node(
+                quadTree1.val || quadTree2.val,
+                node.val,
+                node.val ? null : node1.topLeft,
+                node.val ? null : node1.topRight,
+                node.val ? null : node1.bottomLeft,
+                node.val ? null : node1.bottomRight
+            );
+        }
+    }
+}

algorithms/QuadTreeIntersection/solution.py

@@ -0,0 +1,55 @@
+"""
+# Definition for a QuadTree node.
+class Node(object):
+    def __init__(self, val, isLeaf, topLeft, topRight, bottomLeft, bottomRight):
+        self.val = val
+        self.isLeaf = isLeaf
+        self.topLeft = topLeft
+        self.topRight = topRight
+        self.bottomLeft = bottomLeft
+        self.bottomRight = bottomRight
+"""
+class Solution(object):
+    def intersect(self, quadTree1, quadTree2):
+        """
+        :type quadTree1: Node
+        :type quadTree2: Node
+        :rtype: Node
+        """
+        if quadTree1.isLeaf and quadTree2.isLeaf:
+            return Node(quadTree1.val or quadTree2.val, True, None, None, None, None)
+        elif quadTree1.isLeaf and not quadTree2.isLeaf:
+            val = quadTree1.val or quadTree2.val
+            return Node(
+                val,
+                quadTree1.val,
+                None if quadTree1.val else quadTree2.topLeft,
+                None if quadTree1.val else quadTree2.topRight,
+                None if quadTree1.val else quadTree2.bottomLeft,
+                None if quadTree1.val else quadTree2.bottomRight
+            )
+        elif not quadTree1.isLeaf and quadTree2.isLeaf:
+            val = quadTree1.val or quadTree2.val
+            return Node(
+                val,
+                quadTree2.val,
+                None if quadTree2.val else quadTree1.topLeft,
+                None if quadTree2.val else quadTree1.topRight,
+                None if quadTree2.val else quadTree1.bottomLeft,
+                None if quadTree2.val else quadTree1.bottomRight
+            )
+        else:
+            topLeft = self.intersect(quadTree1.topLeft, quadTree2.topLeft)
+            topRight = self.intersect(quadTree1.topRight, quadTree2.topRight)
+            bottomLeft = self.intersect(quadTree1.bottomLeft, quadTree2.bottomLeft)
+            bottomRight = self.intersect(quadTree1.bottomRight, quadTree2.bottomRight)
+            isLeaf = topLeft.isLeaf == topRight.isLeaf == bottomLeft.isLeaf == bottomRight.isLeaf == True and topLeft.val == topRight.val == bottomLeft.val == bottomRight.val
+            return Node(
+                topLeft.val,
+                isLeaf,
+                topLeft if not isLeaf else None,
+                topRight if not isLeaf else None,
+                bottomLeft if not isLeaf else None,
+                bottomRight if not isLeaf else None
+            )
+