Improved tasks 399, 530, 637

javadev · javadev · commit 4094e51c9fa4 · 2025-07-19T03:31:46.000+03:00
diff --git a/LeetCodeNet.Tests/G0301_0400/S0399_evaluate_division/SolutionTest.cs b/LeetCodeNet.Tests/G0301_0400/S0399_evaluate_division/SolutionTest.cs
@@ -0,0 +1,61 @@
+namespace LeetCodeNet.G0301_0400.S0399_evaluate_division {
+
+using System;
+using System.Collections.Generic;
+using System.Linq;
+using Xunit;
+
+public static class ArrayUtils {
+    public static IList<IList<string>> GetLists(string[][] array) {
+        var result = new List<IList<string>>();
+        foreach (var innerArray in array) {
+            result.Add(innerArray.ToList());
+        }
+        return result;
+    }
+}
+
+public class SolutionTest {
+    private const double Tolerance = 0.00001;
+
+    [Fact]
+    public void CalcEquation() {
+        IList<IList<string>> equations = ArrayUtils.GetLists(new string[][] {new string[] {"a", "b"}, new string[] {"b", "c"}});
+        double[] values = new double[] {2.0, 3.0};
+        IList<IList<string>> queries =
+            ArrayUtils.GetLists(
+                new string[][] {
+                    new string[] {"a", "c"}, new string[] {"b", "a"}, new string[] {"a", "e"}, new string[] {"a", "a"}, new string[] {"x", "x"}
+                });
+        double[] expected = {6.00000, 0.50000, -1.00000, 1.00000, -1.00000};
+        // For comparing double arrays with precision, use a loop or a custom assertion method
+        Assert.Equal(expected, new Solution().CalcEquation(equations, values, queries), Tolerance);
+    }
+
+    [Fact]
+    public void CalcEquation2() {
+        IList<IList<string>> equations =
+            ArrayUtils.GetLists(new string[][] {new string[] {"a", "b"}, new string[] {"b", "c"}, new string[] {"bc", "cd"}});
+        double[] values = new double[] {1.5, 2.5, 5.0};
+        IList<IList<string>> queries =
+            ArrayUtils.GetLists(
+                new string[][] {new string[] {"a", "c"}, new string[] {"c", "b"}, new string[] {"bc", "cd"}, new string[] {"cd", "bc"}});
+        double[] expected = {3.75000, 0.40000, 5.00000, 0.20000};
+        Assert.Equal(expected, new Solution().CalcEquation(equations, values, queries), Tolerance);
+    }
+
+    [Fact]
+    public void CalcEquation3() {
+        // Direct initialization of List<List<string>>
+        IList<IList<string>> equations = new List<IList<string>> {
+            new List<string> {"a", "b"}
+        };
+        double[] values = new double[] {0.5};
+        IList<IList<string>> queries =
+            ArrayUtils.GetLists(
+                new string[][] {new string[] {"a", "b"}, new string[] {"b", "a"}, new string[] {"a", "c"}, new string[] {"x", "y"}});
+        double[] expected = {0.50000, 2.00000, -1.00000, -1.00000};
+        Assert.Equal(expected, new Solution().CalcEquation(equations, values, queries), Tolerance);
+    }
+}
+}
diff --git a/LeetCodeNet.Tests/G0501_0600/S0530_minimum_absolute_difference_in_bst/SolutionTest.cs b/LeetCodeNet.Tests/G0501_0600/S0530_minimum_absolute_difference_in_bst/SolutionTest.cs
@@ -0,0 +1,21 @@
+namespace LeetCodeNet.G0501_0600.S0530_minimum_absolute_difference_in_bst {
+
+using System;
+using LeetCodeNet.Com_github_leetcode;
+using Xunit;
+
+public class SolutionTest {
+    [Fact]
+    public void GetMinimumDifference() {
+        TreeNode treeNode = TreeUtils.ConstructBinaryTree(new List<int?> {4, 2, 6, 1, 3});
+        Assert.Equal(1, new Solution().GetMinimumDifference(treeNode));
+    }
+
+    [Fact]
+    public void GetMinimumDifference2() {
+        TreeNode treeNode =
+            TreeUtils.ConstructBinaryTree(new List<int?> {1, 0, 48, null, null, 12, 49});
+        Assert.Equal(1, new Solution().GetMinimumDifference(treeNode));
+    }
+}
+}
diff --git a/LeetCodeNet.Tests/G0601_0700/S0637_average_of_levels_in_binary_tree/SolutionTest.cs b/LeetCodeNet.Tests/G0601_0700/S0637_average_of_levels_in_binary_tree/SolutionTest.cs
@@ -0,0 +1,51 @@
+namespace LeetCodeNet.G0601_0700.S0637_average_of_levels_in_binary_tree {
+
+using System;
+using LeetCodeNet.Com_github_leetcode;
+using Xunit;
+
+public class SolutionTest {
+    [Fact]
+    public void AverageOfLevels() {
+        TreeNode treeNode = TreeNode.Create(new List<int?> {3, 9, 20, null, null, 15, 7});
+        Assert.Equal(new List<double> {3.00000, 14.50000, 11.00000}, new Solution().AverageOfLevels(treeNode),
+                     new DoubleListComparer(0.00001));
+    }
+
+    [Fact]
+    public void AverageOfLevels2() {
+        TreeNode treeNode = TreeNode.Create(new List<int?> {3, 9, 20, 15, 7});
+        Assert.Equal(new List<double> {3.00000, 14.50000, 11.00000}, new Solution().AverageOfLevels(treeNode),
+                     new DoubleListComparer(0.00001));
+    }
+}
+
+public class DoubleListComparer : IEqualityComparer<IList<double>> {
+    private readonly double _tolerance;
+
+    public DoubleListComparer(double tolerance) {
+        _tolerance = tolerance;
+    }
+
+    public bool Equals(IList<double> x, IList<double> y) {
+        if (ReferenceEquals(x, y)) return true;
+        if (ReferenceEquals(x, null) || ReferenceEquals(y, null)) return false;
+        if (x.Count != y.Count) return false;
+
+        for (int i = 0; i < x.Count; i++) {
+            if (Math.Abs(x[i] - y[i]) > _tolerance) {
+                return false;
+            }
+        }
+        return true;
+    }
+
+    public int GetHashCode(IList<double> obj) {
+        int hash = 17;
+        foreach (var d in obj) {
+            hash = hash * 31 + d.GetHashCode();
+        }
+        return hash;
+    }
+}
+}
