Fixed compile

javadev · javadev · commit 2255f6dc340d · 2025-07-18T09:36:11.000+03:00
diff --git a/LeetCodeNet/G0401_0500/S0427_construct_quad_tree/Solution.cs b/LeetCodeNet/G0401_0500/S0427_construct_quad_tree/Solution.cs
@@ -3,7 +3,57 @@ namespace LeetCodeNet.G0401_0500.S0427_construct_quad_tree {
 // #Medium #Array #Tree #Matrix #Divide_and_Conquer #Top_Interview_150_Divide_and_Conquer
 // #2025_07_18_Time_91_ms_(66.88%)_Space_47.25_MB_(80.00%)
 
-using LeetCodeNet.Com_github_leetcode;
+using System.Text;
+
+public class Node {
+    public bool val;
+    public bool isLeaf;
+    public Node? topLeft;
+    public Node? topRight;
+    public Node? bottomLeft;
+    public Node? bottomRight;
+
+    public Node(bool val, bool isLeaf) {
+        this.val = val;
+        this.isLeaf = isLeaf;
+        this.topLeft = null;
+        this.topRight = null;
+        this.bottomLeft = null;
+        this.bottomRight = null;
+    }
+
+    public Node(
+        bool val,
+        bool 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 override string ToString() {
+        StringBuilder sb = new StringBuilder();
+        sb.Append(GetNodeString(this));
+        sb.Append(GetNodeString(topLeft));
+        sb.Append(GetNodeString(topRight));
+        sb.Append(GetNodeString(bottomLeft));
+        sb.Append(GetNodeString(bottomRight));
+        return sb.ToString();
+    }
+
+    private string GetNodeString(Node? node) {
+        if (node == null) {
+            return "[]";
+        }
+        return $"[{(node.isLeaf ? "1" : "0")},{(node.val ? "1" : "0")}]";
+    }
+}
 
 /*
 // Definition for a QuadTree node.
