Movatterモバイル変換

[0]ホーム
URL:

Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

 Sign up
Appearance settings

Commit603db53

Browse files
authored
Updated readme
1 parentb324331 commit603db53

File tree

36 files changed

+55
-45
lines changed

36 files changed

+55
-45
lines changed

‎LeetCodeNet.Tests/G0001_0100/S0001_two_sum/SolutionTest.cs

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,5 @@
11
namespaceLeetCodeNet.G0001_0100.S0001_two_sum{
2-
usingSystem;
2+
33
usingXunit;
44

55
publicclassSolutionTest{

‎LeetCodeNet.Tests/G0001_0100/S0003_longest_substring_without_repeating_characters/SolutionTest.cs

Lines changed: 0 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,6 @@
11
namespaceLeetCodeNet.G0001_0100.S0003_longest_substring_without_repeating_characters{
22

33
usingXunit;
4-
usingSystem;
54

65
publicclassSolutionTest{
76
[Fact]

‎LeetCodeNet.Tests/G0001_0100/S0004_median_of_two_sorted_arrays/SolutionTest.cs

Lines changed: 0 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,6 @@
11
namespaceLeetCodeNet.G0001_0100.S0004_median_of_two_sorted_arrays{
22

33
usingXunit;
4-
usingSystem;
54

65
publicclassSolutionTest{
76
[Fact]

‎LeetCodeNet.Tests/G0001_0100/S0005_longest_palindromic_substring/SolutionTest.cs

Lines changed: 0 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,6 @@
11
namespaceLeetCodeNet.G0001_0100.S0005_longest_palindromic_substring{
22

33
usingXunit;
4-
usingSystem;
54

65
publicclassSolutionTest{
76
[Fact]

‎LeetCodeNet.Tests/G0001_0100/S0006_zigzag_conversion/SolutionTest.cs

Lines changed: 0 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,6 @@
11
namespaceLeetCodeNet.G0001_0100.S0006_zigzag_conversion{
22

33
usingXunit;
4-
usingSystem;
54

65
publicclassSolutionTest{
76
[Fact]

‎LeetCodeNet.Tests/G0001_0100/S0007_reverse_integer/SolutionTest.cs

Lines changed: 0 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,6 @@
11
namespaceLeetCodeNet.G0001_0100.S0007_reverse_integer{
22

33
usingXunit;
4-
usingSystem;
54

65
publicclassSolutionTest{
76
[Fact]

‎LeetCodeNet.Tests/G0001_0100/S0008_string_to_integer_atoi/SolutionTest.cs

Lines changed: 0 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,6 @@
11
namespaceLeetCodeNet.G0001_0100.S0008_string_to_integer_atoi{
22

33
usingXunit;
4-
usingSystem;
54

65
publicclassSolutionTest{
76
[Fact]
Lines changed: 3 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -1,22 +1,21 @@
11
namespaceLeetCodeNet.G0001_0100.S0009_palindrome_number{
22

33
usingXunit;
4-
usingSystem;
54

65
publicclassSolutionTest{
76
[Fact]
87
publicvoidIsPalindrome(){
9-
Assert.Equal(true,newSolution().IsPalindrome(121));
8+
Assert.True(newSolution().IsPalindrome(121));
109
}
1110

1211
[Fact]
1312
publicvoidIsPalindrome2(){
14-
Assert.Equal(false,newSolution().IsPalindrome(-121));
13+
Assert.False(newSolution().IsPalindrome(-121));
1514
}
1615

1716
[Fact]
1817
publicvoidIsPalindrome3(){
19-
Assert.Equal(false,newSolution().IsPalindrome(10));
18+
Assert.False(newSolution().IsPalindrome(10));
2019
}
2120
}
2221
}
Lines changed: 5 additions & 6 deletions
Original file line numberDiff line numberDiff line change
@@ -1,32 +1,31 @@
11
namespaceLeetCodeNet.G0001_0100.S0010_regular_expression_matching{
22

33
usingXunit;
4-
usingSystem;
54

65
publicclassSolutionTest{
76
[Fact]
87
publicvoidIsMatch(){
9-
Assert.Equal(false,newSolution().IsMatch("aa","a"));
8+
Assert.False(newSolution().IsMatch("aa","a"));
109
}
1110

1211
[Fact]
1312
publicvoidIsMatch2(){
14-
Assert.Equal(true,newSolution().IsMatch("aa","a*"));
13+
Assert.True(newSolution().IsMatch("aa","a*"));
1514
}
1615

1716
[Fact]
1817
publicvoidIsMatch3(){
19-
Assert.Equal(true,newSolution().IsMatch("ab",".*"));
18+
Assert.True(newSolution().IsMatch("ab",".*"));
2019
}
2120

2221
[Fact]
2322
publicvoidIsMatch4(){
24-
Assert.Equal(true,newSolution().IsMatch("aab","c*a*b"));
23+
Assert.True(newSolution().IsMatch("aab","c*a*b"));
2524
}
2625

2726
[Fact]
2827
publicvoidIsMatch5(){
29-
Assert.Equal(false,newSolution().IsMatch("mississippi","mis*is*p*."));
28+
Assert.False(newSolution().IsMatch("mississippi","mis*is*p*."));
3029
}
3130
}
3231
}

‎LeetCodeNet.Tests/G0001_0100/S0048_rotate_image/SolutionTest.cs

Lines changed: 0 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,5 @@
11
namespaceLeetCodeNet.G0001_0100.S0048_rotate_image{
22

3-
usingSystem;
43
usingXunit;
54

65
publicclassSolutionTest{

‎LeetCodeNet.Tests/G0001_0100/S0049_group_anagrams/SolutionTest.cs

Lines changed: 0 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,5 @@
11
namespaceLeetCodeNet.G0001_0100.S0049_group_anagrams{
22

3-
usingSystem;
43
usingXunit;
54

65
publicclassSolutionTest{

‎LeetCodeNet.Tests/G0001_0100/S0051_n_queens/SolutionTest.cs

Lines changed: 0 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,5 @@
11
namespaceLeetCodeNet.G0001_0100.S0051_n_queens{
22

3-
usingSystem;
43
usingXunit;
54

65
publicclassSolutionTest{

‎LeetCodeNet.Tests/G0001_0100/S0053_maximum_subarray/SolutionTest.cs

Lines changed: 0 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,5 @@
11
namespaceLeetCodeNet.G0001_0100.S0053_maximum_subarray{
22

3-
usingSystem;
43
usingXunit;
54

65
publicclassSolutionTest{

‎LeetCodeNet.Tests/G0001_0100/S0055_jump_game/SolutionTest.cs

Lines changed: 0 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,5 @@
11
namespaceLeetCodeNet.G0001_0100.S0055_jump_game{
22

3-
usingSystem;
43
usingXunit;
54

65
publicclassSolutionTest{

‎LeetCodeNet.Tests/G0001_0100/S0056_merge_intervals/SolutionTest.cs

Lines changed: 0 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,5 @@
11
namespaceLeetCodeNet.G0001_0100.S0056_merge_intervals{
22

3-
usingSystem;
43
usingXunit;
54

65
publicclassSolutionTest{

‎LeetCodeNet.Tests/G0001_0100/S0062_unique_paths/SolutionTest.cs

Lines changed: 0 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,5 @@
11
namespaceLeetCodeNet.G0001_0100.S0062_unique_paths{
22

3-
usingSystem;
43
usingXunit;
54

65
publicclassSolutionTest{

‎LeetCodeNet.Tests/G0001_0100/S0064_minimum_path_sum/SolutionTest.cs

Lines changed: 0 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,5 @@
11
namespaceLeetCodeNet.G0001_0100.S0064_minimum_path_sum{
22

3-
usingSystem;
43
usingXunit;
54

65
publicclassSolutionTest{

‎LeetCodeNet.Tests/G0001_0100/S0070_climbing_stairs/SolutionTest.cs

Lines changed: 0 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,5 @@
11
namespaceLeetCodeNet.G0001_0100.S0070_climbing_stairs{
22

3-
usingSystem;
43
usingXunit;
54

65
publicclassSolutionTest{

‎LeetCodeNet.Tests/G0001_0100/S0072_edit_distance/SolutionTest.cs

Lines changed: 0 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,5 @@
11
namespaceLeetCodeNet.G0001_0100.S0072_edit_distance{
22

3-
usingSystem;
43
usingXunit;
54

65
publicclassSolutionTest{

‎LeetCodeNet.Tests/G0001_0100/S0073_set_matrix_zeroes/SolutionTest.cs

Lines changed: 0 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,5 @@
11
namespaceLeetCodeNet.G0001_0100.S0073_set_matrix_zeroes{
22

3-
usingSystem;
43
usingXunit;
54

65
publicclassSolutionTest{

‎LeetCodeNet.Tests/G0001_0100/S0074_search_a_2d_matrix/SolutionTest.cs

Lines changed: 0 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,5 @@
11
namespaceLeetCodeNet.G0001_0100.S0074_search_a_2d_matrix{
22

3-
usingSystem;
43
usingXunit;
54

65
publicclassSolutionTest{

‎LeetCodeNet.Tests/G0001_0100/S0075_sort_colors/SolutionTest.cs

Lines changed: 0 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,5 @@
11
namespaceLeetCodeNet.G0001_0100.S0075_sort_colors{
22

3-
usingSystem;
43
usingXunit;
54

65
publicclassSolutionTest{

‎LeetCodeNet.Tests/G0001_0100/S0076_minimum_window_substring/SolutionTest.cs

Lines changed: 0 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,5 @@
11
namespaceLeetCodeNet.G0001_0100.S0076_minimum_window_substring{
22

3-
usingSystem;
43
usingXunit;
54

65
publicclassSolutionTest{

‎LeetCodeNet.Tests/G0001_0100/S0079_word_search/SolutionTest.cs

Lines changed: 0 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,5 @@
11
namespaceLeetCodeNet.G0001_0100.S0079_word_search{
22

3-
usingSystem;
43
usingXunit;
54

65
publicclassSolutionTest{

‎LeetCodeNet.Tests/G0101_0200/S0102_binary_tree_level_order_traversal/SolutionTest.cs

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -1,14 +1,14 @@
11
namespaceLeetCodeNet.G0101_0200.S0102_binary_tree_level_order_traversal{
22

3-
usingSystem;
43
usingXunit;
54
usingCom_github_leetcode;
65

76
publicclassSolutionTest{
87
[Fact]
9-
publicvoidLevelOrder1(){
8+
publicvoidLevelOrder(){
109
TreeNoderoot=TreeUtils.ConstructBinaryTree(newList<int?>{3,9,20,null,null,15,7});
11-
Assert.Equal(newList<IList<int>>{newList<int>{3},newList<int>{9,20},newList<int>{15,7}},newSolution().LevelOrder(root));
10+
Assert.Equal(newList<IList<int>>{newList<int>{3},newList<int>{9,20},
11+
newList<int>{15,7}},newSolution().LevelOrder(root));
1212
}
1313

1414
[Fact]

‎LeetCodeNet.Tests/G0101_0200/S0104_maximum_depth_of_binary_tree/SolutionTest.cs

Lines changed: 0 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,5 @@
11
namespaceLeetCodeNet.G0101_0200.S0104_maximum_depth_of_binary_tree{
22

3-
usingSystem;
43
usingXunit;
54
usingCom_github_leetcode;
65

‎LeetCodeNet.Tests/G0101_0200/S0105_construct_binary_tree_from_preorder_and_inorder_traversal/SolutionTest.cs

Lines changed: 0 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,5 @@
11
namespaceLeetCodeNet.G0101_0200.S0105_construct_binary_tree_from_preorder_and_inorder_traversal{
22

3-
usingSystem;
43
usingXunit;
54
usingLeetCodeNet.Com_github_leetcode;
65

‎LeetCodeNet.Tests/G0101_0200/S0114_flatten_binary_tree_to_linked_list/SolutionTest.cs

Lines changed: 0 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,5 @@
11
namespaceLeetCodeNet.G0101_0200.S0114_flatten_binary_tree_to_linked_list{
22

3-
usingSystem;
43
usingXunit;
54
usingLeetCodeNet.Com_github_leetcode;
65

‎LeetCodeNet.Tests/G0101_0200/S0121_best_time_to_buy_and_sell_stock/SolutionTest.cs

Lines changed: 0 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,5 @@
11
namespaceLeetCodeNet.G0101_0200.S0121_best_time_to_buy_and_sell_stock{
22

3-
usingSystem;
43
usingXunit;
54

65
publicclassSolutionTest{

‎LeetCodeNet.Tests/G0101_0200/S0124_binary_tree_maximum_path_sum/SolutionTest.cs

Lines changed: 0 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,5 @@
11
namespaceLeetCodeNet.G0101_0200.S0124_binary_tree_maximum_path_sum{
22

3-
usingSystem;
43
usingXunit;
54
usingCom_github_leetcode;
65

‎LeetCodeNet.Tests/G0101_0200/S0128_longest_consecutive_sequence/SolutionTest.cs

Lines changed: 0 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,5 @@
11
namespaceLeetCodeNet.G0101_0200.S0128_longest_consecutive_sequence{
22

3-
usingSystem;
43
usingXunit;
54

65
publicclassSolutionTest{

‎LeetCodeNet.Tests/G0101_0200/S0131_palindrome_partitioning/SolutionTest.cs

Lines changed: 0 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,5 @@
11
namespaceLeetCodeNet.G0101_0200.S0131_palindrome_partitioning{
22

3-
usingSystem;
43
usingXunit;
54

65
publicclassSolutionTest{

‎LeetCodeNet.Tests/G0101_0200/S0136_single_number/SolutionTest.cs

Lines changed: 0 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,5 @@
11
namespaceLeetCodeNet.G0101_0200.S0136_single_number{
22

3-
usingSystem;
43
usingXunit;
54

65
publicclassSolutionTest{

‎LeetCodeNet.Tests/G0101_0200/S0138_copy_list_with_random_pointer/SolutionTest.cs

Lines changed: 0 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,5 @@
11
namespaceLeetCodeNet.G0101_0200.S0138_copy_list_with_random_pointer{
22

3-
usingSystem;
43
usingXunit;
54
usingLeetCodeNet.Com_github_leetcode;
65

‎LeetCodeNet.Tests/G0401_0500/S0416_partition_equal_subset_sum/SolutionTest.cs

Lines changed: 0 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,5 @@
11
namespaceLeetCodeNet.G0401_0500.S0416_partition_equal_subset_sum{
22

3-
usingSystem;
43
usingXunit;
54

65
publicclassSolutionTest{

0 commit comments

Comments
 (0)
[8]ページ先頭
©2009-2025 Movatter.jp