Leetcode_558_四叉树交集_递归

九幽孤翎

于 2022-07-25 10:00:06 发布

阅读量163

点赞数

CC 4.0 BY-SA版权

分类专栏： daily_algorithm 递归文章标签： leetcode 算法职场和发展

本文链接：https://blog.youkuaiyun.com/HDUCheater/article/details/125969112

daily_algorithm 同时被 2 个专栏收录

230 篇文章

订阅专栏

递归

7 篇文章

订阅专栏

class Solution {
    public Node intersect(Node quadTree1, Node quadTree2) {
        if (quadTree1.isLeaf) {
            if (quadTree1.val) {
                return quadTree1;
            } else {
                quadTree1.isLeaf = false;
                return quadTree2;
            }
        }
        if (quadTree2.isLeaf) {
            if (quadTree2.val) {
                quadTree1.isLeaf = true;
                return quadTree2;
            } else {
                return quadTree1;
            }
        }
        quadTree1.bottomLeft = intersect(quadTree1.bottomLeft, quadTree2.bottomLeft);
        quadTree1.bottomRight = intersect(quadTree1.bottomRight, quadTree2.bottomRight);
        quadTree1.topLeft = intersect(quadTree1.topLeft, quadTree2.topLeft);
        quadTree1.topRight = intersect(quadTree1.topRight, quadTree2.topRight);
        if (judge(quadTree1.bottomLeft) && judge(quadTree1.bottomRight) && judge(quadTree1.topLeft) && judge(quadTree1.topRight)) {
            quadTree1.isLeaf = true;
            quadTree1.val = true;
            quadTree1.bottomLeft = null;
            quadTree1.bottomRight = null;
            quadTree1.topLeft = null;
            quadTree1.topRight = null;
        }
        return quadTree1;
    }

    boolean judge(Node node) {
        return node != null && node.isLeaf && node.val;
    }
}