Added tasks 206-238

Author: javadev

LeetCodeNet.Tests/G0101_0200/S0102_binary_tree_level_order_traversal/SolutionTest.cs

@@ -1,7 +1,7 @@
 namespace LeetCodeNet.G0101_0200.S0102_binary_tree_level_order_traversal {
 
 using Xunit;
-using Com_github_leetcode;
+using LeetCodeNet.Com_github_leetcode;
 
 public class SolutionTest {
     [Fact]

LeetCodeNet.Tests/G0101_0200/S0104_maximum_depth_of_binary_tree/SolutionTest.cs

@@ -1,7 +1,7 @@
 namespace LeetCodeNet.G0101_0200.S0104_maximum_depth_of_binary_tree {
 
 using Xunit;
-using Com_github_leetcode;
+using LeetCodeNet.Com_github_leetcode;
 
 public class SolutionTest {
     [Fact]

LeetCodeNet.Tests/G0101_0200/S0124_binary_tree_maximum_path_sum/SolutionTest.cs

@@ -1,7 +1,7 @@
 namespace LeetCodeNet.G0101_0200.S0124_binary_tree_maximum_path_sum {
 
 using Xunit;
-using Com_github_leetcode;
+using LeetCodeNet.Com_github_leetcode;
 
 public class SolutionTest {
     [Fact]

LeetCodeNet.Tests/G0101_0200/S0142_linked_list_cycle_ii/SolutionTest.cs

@@ -25,7 +25,7 @@ public void DetectCycle2() {
     [Fact]
     public void DetectCycle3() {
         ListNode listNode1 = new ListNode(1);
-        Assert.Equal(null, new Solution().DetectCycle(listNode1));
+        Assert.Null(new Solution().DetectCycle(listNode1));
     }
 }
 }

LeetCodeNet.Tests/G0101_0200/S0148_sort_list/SolutionTest.cs

@@ -25,7 +25,7 @@ public void SortList2() {
 
     [Fact]
     public void SortList3() {
-        Assert.Equal(null, new Solution().SortList(null));
+        Assert.Null(new Solution().SortList(null));
     }
 }
 }

LeetCodeNet.Tests/G0201_0300/S0206_reverse_linked_list/SolutionTest.cs

@@ -0,0 +1,29 @@
+namespace LeetCodeNet.G0201_0300.S0206_reverse_linked_list {
+
+using Xunit;
+using LeetCodeNet.Com_github_leetcode;
+
+public class SolutionTest {
+    [Fact]
+    public void ReverseList() {
+        ListNode headActual = new ListNode(1);
+        headActual.next = new ListNode(2);
+        headActual.next.next = new ListNode(3);
+        headActual.next.next.next = new ListNode(4);
+        headActual.next.next.next.next = new ListNode(5);
+        Assert.Equal("5, 4, 3, 2, 1", new Solution().ReverseList(headActual).ToString());
+    }
+
+    [Fact]
+    public void ReverseList2() {
+        ListNode headActual = new ListNode(1);
+        headActual.next = new ListNode(2);
+        Assert.Equal("2, 1", new Solution().ReverseList(headActual).ToString());
+    }
+
+    [Fact]
+    public void ReverseList3() {
+        Assert.Null(new Solution().ReverseList(null));
+    }
+}
+}

LeetCodeNet.Tests/G0201_0300/S0207_course_schedule/SolutionTest.cs

@@ -0,0 +1,16 @@
+namespace LeetCodeNet.G0201_0300.S0207_course_schedule {
+
+using Xunit;
+
+public class SolutionTest {
+    [Fact]
+    public void CanFinish() {
+        Assert.True(new Solution().CanFinish(2, new int[][] { new int[] { 1, 0 } }));
+    }
+
+    [Fact]
+    public void CanFinish2() {
+        Assert.False(new Solution().CanFinish(2, new int[][] { new int[] { 1, 0 }, new int[] { 0, 1 } }));
+    }
+}
+}

LeetCodeNet.Tests/G0201_0300/S0208_implement_trie_prefix_tree/TrieTest.cs

@@ -0,0 +1,21 @@
+namespace LeetCodeNet.G0201_0300.S0208_implement_trie_prefix_tree {
+
+using Xunit;
+
+public class TrieTest {
+    [Fact]
+    public void Trie() {
+        Trie trie = new Trie();
+        trie.Insert("apple");
+        // return True
+        Assert.True(trie.Search("apple"));
+        // return False
+        Assert.False(trie.Search("app"));
+        // return True
+        Assert.True(trie.StartsWith("app"));
+        trie.Insert("app");
+        // return True
+        Assert.True(trie.Search("app"));
+    }
+}
+}

LeetCodeNet.Tests/G0201_0300/S0215_kth_largest_element_in_an_array/SolutionTest.cs

@@ -0,0 +1,16 @@
+namespace LeetCodeNet.G0201_0300.S0215_kth_largest_element_in_an_array {
+
+using Xunit;
+
+public class SolutionTest {
+    [Fact]
+    public void FindKthLargest() {
+        Assert.Equal(5, new Solution().FindKthLargest(new int[] { 3, 2, 1, 5, 6, 4 }, 2));
+    }
+
+    [Fact]
+    public void FindKthLargest2() {
+        Assert.Equal(4, new Solution().FindKthLargest(new int[] { 3, 2, 3, 1, 2, 4, 5, 5, 6 }, 4));
+    }
+}
+}

LeetCodeNet.Tests/G0201_0300/S0221_maximal_square/SolutionTest.cs

@@ -0,0 +1,29 @@
+namespace LeetCodeNet.G0201_0300.S0221_maximal_square {
+
+using Xunit;
+
+public class SolutionTest {
+    [Fact]
+    public void MaximalSquare() {
+        char[][] input = {
+            new[] {'1', '0', '1', '0', '0'},
+            new[] {'1', '0', '1', '1', '1'},
+            new[] {'1', '1', '1', '1', '1'},
+            new[] {'1', '0', '0', '1', '0'}
+        };
+        Assert.Equal(4, new Solution().MaximalSquare(input));
+    }
+
+    [Fact]
+    public void MaximalSquare2() {
+        char[][] input = { new[] {'0', '1'}, new[] {'1', '0'} };
+        Assert.Equal(1, new Solution().MaximalSquare(input));
+    }
+
+    [Fact]
+    public void MaximalSquare3() {
+        char[][] input = { new[] {'0'} };
+        Assert.Equal(0, new Solution().MaximalSquare(input));
+    }
+}
+}