zoukankan      html  css  js  c++  java
  • leetcode 427. Construct Quad Tree

    We want to use quad trees to store an N x N boolean grid. Each cell in the grid can only be true or false. The root node represents the whole 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 val. isLeaf 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.

    Your task is to use a quad tree to represent a given grid. The following example may help you understand the problem better:

    Given the 8 x 8 grid below, we want to construct the corresponding quad tree:

    It can be divided according to the definition above:

    The corresponding quad tree should be as following, where each node is represented as a (isLeaf, val) pair.

    For the non-leaf nodes, val can be arbitrary, so it is represented as *.

    Note:

    1. N is less than 1000 and guaranteened to be a power of 2.
    2. If you want to know more about the quad tree, you can refer to its wiki.
    """
    # 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 construct(self, grid):
            """
            :type grid: List[List[int]]
            :rtype: Node
            """
            def construct2(g, i1, j1, n):
                s = g[i1][j1]
                is_same = True
                for i in xrange(i1, i1+n):
                    for j in xrange(j1, j1+n):
                        if g[i][j] != s:
                            is_same = False
                            break
                if is_same:
                    return Node(s, True, None, None, None, None)
                else:
                    root = Node("*", False, None, None, None, None)
                    root.topLeft = construct2(g, i1, j1, n/2)
                    root.topRight = construct2(g, i1, j1+n/2, n/2)
                    root.bottomLeft = construct2(g, i1+n/2, j1, n/2)
                    root.bottomRight = construct2(g, i1+n/2, j1+n/2, n/2)
                    return root
        
            return construct2(grid, 0, 0, len(grid))
    

    其他解法,直接是dfs:

    class Solution:
        def construct(self, grid):
            def dfs(x, y, l):
                if l == 1:
                    node = Node(grid[x][y] == 1, True, None, None, None, None)
                else:
                    tLeft = dfs(x, y, l // 2)
                    tRight = dfs(x, y + l // 2, l // 2)
                    bLeft = dfs(x + l // 2, y, l// 2)
                    bRight = dfs(x + l // 2, y + l // 2, l // 2)
                    value = tLeft.val or tRight.val or bLeft.val or bRight.val
                    if tLeft.isLeaf and tRight.isLeaf and bLeft.isLeaf and bRight.isLeaf and tLeft.val == tRight.val == bLeft.val == bRight.val:
                        node = Node(value, True, None, None, None, None)
                    else:
                        node = Node(value, False, tLeft, tRight, bLeft, bRight)
                return node
            return grid and dfs(0, 0, len(grid)) or None
    
  • 相关阅读:
    springMVC学习 十二 拦截器
    SpringMVC 学习 十一 springMVC控制器向jsp或者别的控制器传递参数的四种方法
    SpringMVC 学习 十 SSM环境搭建(三)springMVC文件配置
    iconfont 在项目中的简单使用
    CSS实现带阴影效果的三角形
    前端以数组的方式传参
    JQuery的ajaxFileUpload的使用
    layer弹出层的关闭问题
    e.target与事件委托简例
    SpringBoot项目在IntelliJ IDEA中实现热部署(简单方式)
  • 原文地址:https://www.cnblogs.com/bonelee/p/9357444.html
Copyright © 2011-2022 走看看