Improved tasks 103-117

Author: javadev

LeetCodeNet.Tests/G0101_0200/S0106_construct_binary_tree_from_inorder_and_postorder_traversal/SolutionTest.cs

@@ -1,23 +1,23 @@
 namespace LeetCodeNet.G0101_0200.S0106_construct_binary_tree_from_inorder_and_postorder_traversal {
 
-    using Xunit;
-    using LeetCodeNet.Com_github_leetcode;
-    
-    public class SolutionTest {
-        [Fact]
-        public void ConstructBinaryTree() {
-            int[] inorder = {9, 3, 15, 20, 7};
-            int[] postorder = {9, 15, 7, 20, 3};
-            TreeNode actual = new Solution().BuildTree(inorder, postorder);
-            Assert.Equal("3,9,20,15,7", actual.ToString());
-        }
+using Xunit;
+using LeetCodeNet.Com_github_leetcode;
 
-        [Fact]
-        public void ConstructBinaryTree2() {
-            int[] inorder = {-1};
-            int[] postorder = {-1};
-            TreeNode actual = new Solution().BuildTree(inorder, postorder);
-            Assert.Equal("-1", actual.ToString());
-        }
+public class SolutionTest {
+    [Fact]
+    public void ConstructBinaryTree() {
+        int[] inorder = {9, 3, 15, 20, 7};
+        int[] postorder = {9, 15, 7, 20, 3};
+        TreeNode actual = new Solution().BuildTree(inorder, postorder);
+        Assert.Equal("3,9,20,15,7", actual.ToString());
     }
-} 
+
+    [Fact]
+    public void ConstructBinaryTree2() {
+        int[] inorder = {-1};
+        int[] postorder = {-1};
+        TreeNode actual = new Solution().BuildTree(inorder, postorder);
+        Assert.Equal("-1", actual.ToString());
+    }
+}
+}

LeetCodeNet.Tests/G0101_0200/S0108_convert_sorted_array_to_binary_search_tree/SolutionTest.cs

@@ -1,19 +1,19 @@
 namespace LeetCodeNet.G0101_0200.S0108_convert_sorted_array_to_binary_search_tree {
 
-    using Xunit;
-    using LeetCodeNet.Com_github_leetcode;
-    
-    public class SolutionTest {
-        [Fact]
-        public void SortedArrayToBST() {
-            var actual = new Solution().SortedArrayToBST(new int[] {-10, -3, 0, 5, 9});
-            Assert.Equal("0,-10,null,-3,5,null,9", actual.ToString());
-        }
+using Xunit;
+using LeetCodeNet.Com_github_leetcode;
 
-        [Fact]
-        public void SortedArrayToBST2() {
-            var actual = new Solution().SortedArrayToBST(new int[] {1, 3});
-            Assert.Equal("1,null,3", actual.ToString());
-        }
+public class SolutionTest {
+    [Fact]
+    public void SortedArrayToBST() {
+        var actual = new Solution().SortedArrayToBST(new int[] {-10, -3, 0, 5, 9});
+        Assert.Equal("0,-10,null,-3,5,null,9", actual.ToString());
     }
-} 
+
+    [Fact]
+    public void SortedArrayToBST2() {
+        var actual = new Solution().SortedArrayToBST(new int[] {1, 3});
+        Assert.Equal("1,null,3", actual.ToString());
+    }
+}
+}

LeetCodeNet.Tests/G0101_0200/S0112_path_sum/SolutionTest.cs

@@ -1,25 +1,25 @@
 namespace LeetCodeNet.G0101_0200.S0112_path_sum {
 
-    using Xunit;
-    using System.Collections.Generic;
-    using LeetCodeNet.Com_github_leetcode;
+using Xunit;
+using System.Collections.Generic;
+using LeetCodeNet.Com_github_leetcode;
 
-    public class SolutionTest {
-        [Fact]
-        public void HasPathSum() {
-            var root = TreeNode.Create(new List<int?> {5, 4, 8, 11, null, 13, 4, 7, 2, null, null, null, 1});
-            Assert.True(new Solution().HasPathSum(root, 22));
-        }
+public class SolutionTest {
+    [Fact]
+    public void HasPathSum() {
+        var root = TreeNode.Create(new List<int?> {5, 4, 8, 11, null, 13, 4, 7, 2, null, null, null, 1});
+        Assert.True(new Solution().HasPathSum(root, 22));
+    }
 
-        [Fact]
-        public void HasPathSum2() {
-            var root = TreeNode.Create(new List<int?> {1, 2, 3});
-            Assert.False(new Solution().HasPathSum(root, 22));
-        }
+    [Fact]
+    public void HasPathSum2() {
+        var root = TreeNode.Create(new List<int?> {1, 2, 3});
+        Assert.False(new Solution().HasPathSum(root, 22));
+    }
 
-        [Fact]
-        public void HasPathSum3() {
-            Assert.False(new Solution().HasPathSum(null, 0));
-        }
+    [Fact]
+    public void HasPathSum3() {
+        Assert.False(new Solution().HasPathSum(null, 0));
     }
-} 
+}
+}

LeetCodeNet.Tests/G0101_0200/S0117_populating_next_right_pointers_in_each_node_ii/SolutionTest.cs

@@ -1,49 +1,49 @@
 namespace LeetCodeNet.G0101_0200.S0117_populating_next_right_pointers_in_each_node_ii {
 
-    using Xunit;
-
-    public class SolutionTest {
-        [Fact]
-        public void Connect() {
-            Assert.Null(new Solution().Connect(null));
-        }
-
-        [Fact]
-        public void Connect2() {
-            var node = new Node(
-                1,
-                new Node(2, new Node(4), new Node(5), null),
-                new Node(3, null, new Node(7), null),
-                null);
-
-            var node7 = new Node(7);
-            var node3 = new Node(3, null, node7, null);
-            var node5 = new Node(5, null, null, node7);
-            var node4 = new Node(4, null, null, node5);
-            var node2 = new Node(2, node4, node5, node3);
-            var node1 = new Node(1, node2, node3, null);
-
-            Assert.Equal(node1.ToString(), new Solution().Connect(node).ToString());
-        }
-
-        [Fact]
-        public void Connect3() {
-            var node = new Node(
-                1,
-                new Node(2, new Node(4, new Node(7), null, null), new Node(5), null),
-                new Node(3, null, new Node(6, null, new Node(8), null), null),
-                null);
-
-            var node8 = new Node(8, null, null, null);
-            var node7 = new Node(7, null, null, node8);
-            var node6 = new Node(6, null, node8, null);
-            var node3 = new Node(3, null, node6, null);
-            var node5 = new Node(5, null, null, node6);
-            var node4 = new Node(4, node7, null, node5);
-            var node2 = new Node(2, node4, node5, node3);
-            var node1 = new Node(1, node2, node3, null);
-
-            Assert.Equal(node1.ToString(), new Solution().Connect(node).ToString());
-        }
+using Xunit;
+
+public class SolutionTest {
+    [Fact]
+    public void Connect() {
+        Assert.Null(new Solution().Connect(null));
+    }
+
+    [Fact]
+    public void Connect2() {
+        var node = new Node(
+            1,
+            new Node(2, new Node(4), new Node(5), null),
+            new Node(3, null, new Node(7), null),
+            null);
+
+        var node7 = new Node(7);
+        var node3 = new Node(3, null, node7, null);
+        var node5 = new Node(5, null, null, node7);
+        var node4 = new Node(4, null, null, node5);
+        var node2 = new Node(2, node4, node5, node3);
+        var node1 = new Node(1, node2, node3, null);
+
+        Assert.Equal(node1.ToString(), new Solution().Connect(node).ToString());
+    }
+
+    [Fact]
+    public void Connect3() {
+        var node = new Node(
+            1,
+            new Node(2, new Node(4, new Node(7), null, null), new Node(5), null),
+            new Node(3, null, new Node(6, null, new Node(8), null), null),
+            null);
+
+        var node8 = new Node(8, null, null, null);
+        var node7 = new Node(7, null, null, node8);
+        var node6 = new Node(6, null, node8, null);
+        var node3 = new Node(3, null, node6, null);
+        var node5 = new Node(5, null, null, node6);
+        var node4 = new Node(4, node7, null, node5);
+        var node2 = new Node(2, node4, node5, node3);
+        var node1 = new Node(1, node2, node3, null);
+
+        Assert.Equal(node1.ToString(), new Solution().Connect(node).ToString());
     }
-} 
+}
+}

LeetCodeNet/G0101_0200/S0103_binary_tree_zigzag_level_order_traversal/Solution.cs

@@ -58,4 +58,4 @@ public IList<IList<int>> ZigzagLevelOrder(TreeNode root) {
         return results;
     }
 }
-} 
+}

LeetCodeNet/G0101_0200/S0106_construct_binary_tree_from_inorder_and_postorder_traversal/Solution.cs

@@ -36,4 +36,4 @@ private TreeNode Helper(int[] inorder, int[] postorder, ref int inIndex, ref int
         return root;
     }
 }
-} 
+}

LeetCodeNet/G0101_0200/S0108_convert_sorted_array_to_binary_search_tree/Solution.cs

@@ -35,4 +35,4 @@ private TreeNode MakeTree(int[] nums, int left, int right) {
         return midNode;
     }
 }
-} 
+}

LeetCodeNet/G0101_0200/S0112_path_sum/Solution.cs

@@ -29,4 +29,4 @@ public bool HasPathSum(TreeNode root, int sum) {
         return HasPathSum(root.left, (int)(sum - root.val)) || HasPathSum(root.right, (int)(sum - root.val));
     }
 }
-} 
+}

LeetCodeNet/G0101_0200/S0117_populating_next_right_pointers_in_each_node_ii/Node.cs

@@ -19,4 +19,4 @@ public Node(int _val, Node _left, Node _right, Node _next) {
         next = _next;
     }
 }
-}
+}

LeetCodeNet/G0101_0200/S0117_populating_next_right_pointers_in_each_node_ii/Solution.cs

@@ -26,7 +26,6 @@ public Node(int _val, Node _left, Node _right, Node _next) {
     }
 }
 */
-
 public class Solution {
     public Node Connect(Node root) {
         if (root == null) {
@@ -67,4 +66,4 @@ private Node AdjacentRightNode(Node root) {
         return null;
     }
 }
-} 
+}