427. Construct Quad Tree

以下是题目：

Given a n * n matrix grid of 0's and 1's only. We want to represent the grid with a Quad-Tree.

Return the root of the Quad-Tree representing the grid.

Notice that you can assign the value of a node to True or False when isLeaf is False, and both are accepted in the answer.

A Quad-Tree is a tree data structure in which each internal node has exactly four children. Besides, each node has two attributes:

• val: True if the node represents a grid of 1's or False if the node represents a grid of 0's. 
• isLeaf: True if the node is leaf node on the tree or False if the node has the four children.

class Node {
    public boolean val;
    public boolean isLeaf;
    public Node topLeft;
    public Node topRight;
    public Node bottomLeft;
    public Node bottomRight;
}

We can construct a Quad-Tree from a two-dimensional area using the following steps:

1. If the current grid has the same value (i.e all 1's or all 0's) set isLeaf True and set val to the value of the grid and set the four children to Null and stop.
2. If the current grid has different values, set isLeaf to False and set val to any value and divide the current grid into four sub-grids as shown in the photo.
3. Recurse for each of the children with the proper sub-grid.

If you want to know more about the Quad-Tree, you can refer to the wiki.

Quad-Tree format:

The output represents the serialized format of a Quad-Tree using level order traversal, where null signifies a path terminator where no node exists below.

It is very similar to the serialization of the binary tree. The only difference is that the node is represented as a list [isLeaf, val].

If the value of isLeaf or val is True we represent it as 1 in the list [isLeaf, val] and if the value of isLeaf or val is False we represent it as 0.

 

Example 1:

Input: grid = [[0,1],[1,0]]
Output: [[0,1],[1,0],[1,1],[1,1],[1,0]]
Explanation: The explanation of this example is shown below:
Notice that 0 represnts False and 1 represents True in the photo representing the Quad-Tree.

Example 2:

Input: grid = [[1,1,1,1,0,0,0,0],[1,1,1,1,0,0,0,0],[1,1,1,1,1,1,1,1],[1,1,1,1,1,1,1,1],[1,1,1,1,0,0,0,0],[1,1,1,1,0,0,0,0],[1,1,1,1,0,0,0,0],[1,1,1,1,0,0,0,0]]
Output: [[0,1],[1,1],[0,1],[1,1],[1,0],null,null,null,null,[1,0],[1,0],[1,1],[1,1]]
Explanation: All values in the grid are not the same. We divide the grid into four sub-grids.
The topLeft, bottomLeft and bottomRight each has the same value.
The topRight have different values so we divide it into 4 sub-grids where each has the same value.
Explanation is shown in the photo below:

Example 3:

Input: grid = [[1,1],[1,1]]
Output: [[1,1]]

Example 4:

Input: grid = [[0]]
Output: [[1,0]]

Example 5:

Input: grid = [[1,1,0,0],[1,1,0,0],[0,0,1,1],[0,0,1,1]]
Output: [[0,1],[1,1],[1,0],[1,0],[1,1]]

 

Constraints:

• n == grid.length == grid[i].length
• n == 2^x where 0 <= x <= 6

一开始看觉得挺复杂，仔细分析，也就是类似于树宽度优先遍历，接住了queue。

主题是：判断当前grid范围，如果都是一样的值，则是leaf节点；

如果不一样，分裂为4个子节点，分别挂在当前节点下，当然grid的范围，就变为原来的1/4，即长、款都变为一半。

附代码。

struct NewNode{ //存储到queue的新结构
    NewNode(Node* n, int r, int c, int s): node(n), row(r), col(c), size(s){};
    Node* node;
    int row;
    int col;
    int size;
};

class Solution {
private:
    bool isSame(vector<vector<int>>& grid, int row, int col, int size) //判段当前方块区域是否是相同的值
    {
        int v = grid[row][col];
        for(int i = row; i < row + size; i++)
        {
            for(int j = col; j < col + size; j++)
            {
                if(grid[i][j] != v)
                    return false;
            }
        }
        return true;
    }
public:
    Node* construct(vector<vector<int>>& grid) {
                std::queue<NewNode> helper;
        Node* root = nullptr;
        if(isSame(grid, 0, 0, grid.size()))
        {
            Node* n = new Node(grid[0][0], true);
            return n;
        }
        else
        {
            Node* n = new Node(0, false);
            root = n;
            NewNode d(n, 0, 0, grid.size());
            helper.push(d);
        }
        while(not helper.empty())
        {
            auto data = helper.front();
            helper.pop();
            if(isSame(grid, data.row, data.col, data.size))
            {
                data.node->val = grid[data.row][data.col];
                data.node->isLeaf = true;
            }
            else
            {
                Node* topLeft = new Node(0, false);
                NewNode newtopLeft(topLeft, data.row, data.col, data.size/2);

                Node* topRight = new Node(0, false);
                NewNode newTopRight(topRight, data.row, data.col + data.size/2, data.size/2);

                Node* bottomLeft = new Node(0, false);
                NewNode newBottomLeft(bottomLeft, data.row + data.size/2, data.col, data.size/2);

                Node* bottomRight = new Node(0, false);
                NewNode newBottomRight(bottomRight, data.row + data.size/2, data.col + data.size/2, data.size/2);

                data.node->topLeft = topLeft;
                data.node->topRight = topRight;
                data.node->bottomLeft = bottomLeft;
                data.node->bottomRight = bottomRight;
                helper.push(newtopLeft);
                helper.push(newTopRight);
                helper.push(newBottomLeft);
                helper.push(newBottomRight);
            }
        }
        return root;
    }
};