Improve task 427.

Author: javadev

src/main/java/g0401_0500/s0427_construct_quad_tree/Solution.java

@@ -3,6 +3,44 @@
 // #Medium #Array #Tree #Matrix #Divide_and_Conquer
 // #2022_03_18_Time_1_ms_(85.16%)_Space_46.3_MB_(67.10%)
 
+/*
+// 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() {
+        this.val = false;
+        this.isLeaf = false;
+        this.topLeft = null;
+        this.topRight = null;
+        this.bottomLeft = null;
+        this.bottomRight = null;
+    }
+
+    public Node(boolean val, boolean isLeaf) {
+        this.val = val;
+        this.isLeaf = isLeaf;
+        this.topLeft = null;
+        this.topRight = null;
+        this.bottomLeft = null;
+        this.bottomRight = null;
+    }
+
+    public Node(boolean val, boolean isLeaf, Node topLeft, Node topRight, Node bottomLeft, Node bottomRight) {
+        this.val = val;
+        this.isLeaf = isLeaf;
+        this.topLeft = topLeft;
+        this.topRight = topRight;
+        this.bottomLeft = bottomLeft;
+        this.bottomRight = bottomRight;
+    }
+};
+*/
 public class Solution {
     public Node construct(int[][] grid) {
         return optimizedDfs(grid, 0, 0, grid.length);
@@ -30,7 +68,6 @@ private Node optimizedDfs(int[][] grid, int rowStart, int colStart, int len) {
                 break;
             }
         }
-
         if (oneCount > 0 && zeroCount > 0) {
             int midLen = len / 2;
             Node topLeft = optimizedDfs(grid, rowStart, colStart, midLen);