Updated readme

Author: javadev

LeetCodeNet.Tests/G0001_0100/S0001_two_sum/SolutionTest.cs

@@ -1,5 +1,5 @@
 namespace LeetCodeNet.G0001_0100.S0001_two_sum {
-using System;
+
 using Xunit;
 
 public class SolutionTest {

LeetCodeNet.Tests/G0001_0100/S0003_longest_substring_without_repeating_characters/SolutionTest.cs

@@ -1,7 +1,6 @@
 namespace LeetCodeNet.G0001_0100.S0003_longest_substring_without_repeating_characters {
 
 using Xunit;
-using System;
 
 public class SolutionTest {
     [Fact]

LeetCodeNet.Tests/G0001_0100/S0004_median_of_two_sorted_arrays/SolutionTest.cs

@@ -1,7 +1,6 @@
 namespace LeetCodeNet.G0001_0100.S0004_median_of_two_sorted_arrays {
 
 using Xunit;
-using System;
 
 public class SolutionTest {
     [Fact]

LeetCodeNet.Tests/G0001_0100/S0005_longest_palindromic_substring/SolutionTest.cs

@@ -1,7 +1,6 @@
 namespace LeetCodeNet.G0001_0100.S0005_longest_palindromic_substring {
 
 using Xunit;
-using System;
 
 public class SolutionTest {
     [Fact]

LeetCodeNet.Tests/G0001_0100/S0006_zigzag_conversion/SolutionTest.cs

@@ -1,7 +1,6 @@
 namespace LeetCodeNet.G0001_0100.S0006_zigzag_conversion {
 
 using Xunit;
-using System;
 
 public class SolutionTest {
     [Fact]

LeetCodeNet.Tests/G0001_0100/S0007_reverse_integer/SolutionTest.cs

@@ -1,7 +1,6 @@
 namespace LeetCodeNet.G0001_0100.S0007_reverse_integer {
 
 using Xunit;
-using System;
 
 public class SolutionTest {
     [Fact]

LeetCodeNet.Tests/G0001_0100/S0008_string_to_integer_atoi/SolutionTest.cs

@@ -1,7 +1,6 @@
 namespace LeetCodeNet.G0001_0100.S0008_string_to_integer_atoi {
 
 using Xunit;
-using System;
 
 public class SolutionTest {
     [Fact]

LeetCodeNet.Tests/G0001_0100/S0009_palindrome_number/SolutionTest.cs

@@ -1,22 +1,21 @@
 namespace LeetCodeNet.G0001_0100.S0009_palindrome_number {
 
 using Xunit;
-using System;
 
 public class SolutionTest {
     [Fact]
     public void IsPalindrome() {
-        Assert.Equal(true, new Solution().IsPalindrome(121));
+        Assert.True(new Solution().IsPalindrome(121));
     }
 
     [Fact]
     public void IsPalindrome2() {
-        Assert.Equal(false, new Solution().IsPalindrome(-121));
+        Assert.False(new Solution().IsPalindrome(-121));
     }
 
     [Fact]
     public void IsPalindrome3() {
-        Assert.Equal(false, new Solution().IsPalindrome(10));
+        Assert.False(new Solution().IsPalindrome(10));
     }
 }
 }

LeetCodeNet.Tests/G0001_0100/S0010_regular_expression_matching/SolutionTest.cs

@@ -1,32 +1,31 @@
 namespace LeetCodeNet.G0001_0100.S0010_regular_expression_matching {
 
 using Xunit;
-using System;
 
 public class SolutionTest {
     [Fact]
     public void IsMatch() {
-        Assert.Equal(false, new Solution().IsMatch("aa", "a"));
+        Assert.False(new Solution().IsMatch("aa", "a"));
     }
 
     [Fact]
     public void IsMatch2() {
-        Assert.Equal(true, new Solution().IsMatch("aa", "a*"));
+        Assert.True(new Solution().IsMatch("aa", "a*"));
     }
 
     [Fact]
     public void IsMatch3() {
-        Assert.Equal(true, new Solution().IsMatch("ab", ".*"));
+        Assert.True(new Solution().IsMatch("ab", ".*"));
     }
 
     [Fact]
     public void IsMatch4() {
-        Assert.Equal(true, new Solution().IsMatch("aab", "c*a*b"));
+        Assert.True(new Solution().IsMatch("aab", "c*a*b"));
     }
 
     [Fact]
     public void IsMatch5() {
-        Assert.Equal(false, new Solution().IsMatch("mississippi", "mis*is*p*."));
+        Assert.False(new Solution().IsMatch("mississippi", "mis*is*p*."));
     }
 }
 }

LeetCodeNet.Tests/G0001_0100/S0048_rotate_image/SolutionTest.cs

@@ -1,6 +1,5 @@
 namespace LeetCodeNet.G0001_0100.S0048_rotate_image {
 
-using System;
 using Xunit;
 
 public class SolutionTest {

LeetCodeNet.Tests/G0001_0100/S0049_group_anagrams/SolutionTest.cs

@@ -1,6 +1,5 @@
 namespace LeetCodeNet.G0001_0100.S0049_group_anagrams {
 
-using System;
 using Xunit;
 
 public class SolutionTest {

LeetCodeNet.Tests/G0001_0100/S0051_n_queens/SolutionTest.cs

@@ -1,6 +1,5 @@
 namespace LeetCodeNet.G0001_0100.S0051_n_queens {
 
-using System;
 using Xunit;
 
 public class SolutionTest {

LeetCodeNet.Tests/G0001_0100/S0053_maximum_subarray/SolutionTest.cs

@@ -1,6 +1,5 @@
 namespace LeetCodeNet.G0001_0100.S0053_maximum_subarray {
 
-using System;
 using Xunit;
 
 public class SolutionTest {

LeetCodeNet.Tests/G0001_0100/S0055_jump_game/SolutionTest.cs

@@ -1,6 +1,5 @@
 namespace LeetCodeNet.G0001_0100.S0055_jump_game {
 
-using System;
 using Xunit;
 
 public class SolutionTest {

LeetCodeNet.Tests/G0001_0100/S0056_merge_intervals/SolutionTest.cs

@@ -1,6 +1,5 @@
 namespace LeetCodeNet.G0001_0100.S0056_merge_intervals {
 
-using System;
 using Xunit;
 
 public class SolutionTest {

LeetCodeNet.Tests/G0001_0100/S0062_unique_paths/SolutionTest.cs

@@ -1,6 +1,5 @@
 namespace LeetCodeNet.G0001_0100.S0062_unique_paths {
 
-using System;
 using Xunit;
 
 public class SolutionTest {

LeetCodeNet.Tests/G0001_0100/S0064_minimum_path_sum/SolutionTest.cs

@@ -1,6 +1,5 @@
 namespace LeetCodeNet.G0001_0100.S0064_minimum_path_sum {
 
-using System;
 using Xunit;
 
 public class SolutionTest {

LeetCodeNet.Tests/G0001_0100/S0070_climbing_stairs/SolutionTest.cs

@@ -1,6 +1,5 @@
 namespace LeetCodeNet.G0001_0100.S0070_climbing_stairs {
 
-using System;
 using Xunit;
 
 public class SolutionTest {

LeetCodeNet.Tests/G0001_0100/S0072_edit_distance/SolutionTest.cs

@@ -1,6 +1,5 @@
 namespace LeetCodeNet.G0001_0100.S0072_edit_distance {
 
-using System;
 using Xunit;
 
 public class SolutionTest {

LeetCodeNet.Tests/G0001_0100/S0073_set_matrix_zeroes/SolutionTest.cs

@@ -1,6 +1,5 @@
 namespace LeetCodeNet.G0001_0100.S0073_set_matrix_zeroes {
 
-using System;
 using Xunit;
 
 public class SolutionTest {

LeetCodeNet.Tests/G0001_0100/S0074_search_a_2d_matrix/SolutionTest.cs

@@ -1,6 +1,5 @@
 namespace LeetCodeNet.G0001_0100.S0074_search_a_2d_matrix {
 
-using System;
 using Xunit;
 
 public class SolutionTest {

LeetCodeNet.Tests/G0001_0100/S0075_sort_colors/SolutionTest.cs

@@ -1,6 +1,5 @@
 namespace LeetCodeNet.G0001_0100.S0075_sort_colors {
 
-using System;
 using Xunit;
 
 public class SolutionTest {

LeetCodeNet.Tests/G0001_0100/S0076_minimum_window_substring/SolutionTest.cs

@@ -1,6 +1,5 @@
 namespace LeetCodeNet.G0001_0100.S0076_minimum_window_substring {
 
-using System;
 using Xunit;
 
 public class SolutionTest {

LeetCodeNet.Tests/G0001_0100/S0079_word_search/SolutionTest.cs

@@ -1,6 +1,5 @@
 namespace LeetCodeNet.G0001_0100.S0079_word_search {
 
-using System;
 using Xunit;
 
 public class SolutionTest {

LeetCodeNet.Tests/G0101_0200/S0102_binary_tree_level_order_traversal/SolutionTest.cs

@@ -1,14 +1,14 @@
 namespace LeetCodeNet.G0101_0200.S0102_binary_tree_level_order_traversal {
 
-using System;
 using Xunit;
 using Com_github_leetcode;
 
 public class SolutionTest {
     [Fact]
-    public void LevelOrder1() {
+    public void LevelOrder() {
         TreeNode root = TreeUtils.ConstructBinaryTree(new List<int?> { 3, 9, 20, null, null, 15, 7 });
-        Assert.Equal(new List<IList<int>> { new List<int> { 3 }, new List<int> { 9, 20 }, new List<int> { 15, 7 } }, new Solution().LevelOrder(root));
+        Assert.Equal(new List<IList<int>> { new List<int> { 3 }, new List<int> { 9, 20 },
+            new List<int> { 15, 7 } }, new Solution().LevelOrder(root));
     }
 
     [Fact]

LeetCodeNet.Tests/G0101_0200/S0104_maximum_depth_of_binary_tree/SolutionTest.cs

@@ -1,6 +1,5 @@
 namespace LeetCodeNet.G0101_0200.S0104_maximum_depth_of_binary_tree {
 
-using System;
 using Xunit;
 using Com_github_leetcode;
 

LeetCodeNet.Tests/G0101_0200/S0105_construct_binary_tree_from_preorder_and_inorder_traversal/SolutionTest.cs

@@ -1,6 +1,5 @@
 namespace LeetCodeNet.G0101_0200.S0105_construct_binary_tree_from_preorder_and_inorder_traversal {
 
-using System;
 using Xunit;
 using LeetCodeNet.Com_github_leetcode;
 

LeetCodeNet.Tests/G0101_0200/S0114_flatten_binary_tree_to_linked_list/SolutionTest.cs

@@ -1,6 +1,5 @@
 namespace LeetCodeNet.G0101_0200.S0114_flatten_binary_tree_to_linked_list {
 
-using System;
 using Xunit;
 using LeetCodeNet.Com_github_leetcode;
 

LeetCodeNet.Tests/G0101_0200/S0121_best_time_to_buy_and_sell_stock/SolutionTest.cs

@@ -1,6 +1,5 @@
 namespace LeetCodeNet.G0101_0200.S0121_best_time_to_buy_and_sell_stock {
 
-using System;
 using Xunit;
 
 public class SolutionTest {

LeetCodeNet.Tests/G0101_0200/S0124_binary_tree_maximum_path_sum/SolutionTest.cs

@@ -1,6 +1,5 @@
 namespace LeetCodeNet.G0101_0200.S0124_binary_tree_maximum_path_sum {
 
-using System;
 using Xunit;
 using Com_github_leetcode;
 

LeetCodeNet.Tests/G0101_0200/S0128_longest_consecutive_sequence/SolutionTest.cs

@@ -1,6 +1,5 @@
 namespace LeetCodeNet.G0101_0200.S0128_longest_consecutive_sequence {
 
-using System;
 using Xunit;
 
 public class SolutionTest {

LeetCodeNet.Tests/G0101_0200/S0131_palindrome_partitioning/SolutionTest.cs

@@ -1,6 +1,5 @@
 namespace LeetCodeNet.G0101_0200.S0131_palindrome_partitioning {
 
-using System;
 using Xunit;
 
 public class SolutionTest {

LeetCodeNet.Tests/G0101_0200/S0136_single_number/SolutionTest.cs

@@ -1,6 +1,5 @@
 namespace LeetCodeNet.G0101_0200.S0136_single_number {
 
-using System;
 using Xunit;
 
 public class SolutionTest {

LeetCodeNet.Tests/G0101_0200/S0138_copy_list_with_random_pointer/SolutionTest.cs

@@ -1,6 +1,5 @@
 namespace LeetCodeNet.G0101_0200.S0138_copy_list_with_random_pointer {
 
-using System;
 using Xunit;
 using LeetCodeNet.Com_github_leetcode;
 

LeetCodeNet.Tests/G0401_0500/S0416_partition_equal_subset_sum/SolutionTest.cs

@@ -1,6 +1,5 @@
 namespace LeetCodeNet.G0401_0500.S0416_partition_equal_subset_sum {
 
-using System;
 using Xunit;
 
 public class SolutionTest {