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

Commit06857d9

Browse files
authored
Improved tasks 61-68
1 parent1dbb9d2 commit06857d9

File tree

5 files changed

+19
-19
lines changed

5 files changed

+19
-19
lines changed

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

Lines changed: 4 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -24,30 +24,30 @@ private int[] ToArray(ListNode head) {
2424
}
2525

2626
[Fact]
27-
publicvoidRotateRight_Example1(){
27+
publicvoidRotateRight(){
2828
varsolution=newSolution();
2929
varhead=BuildList(newint[]{1,2,3,4,5});
3030
varresult=solution.RotateRight(head,2);
3131
Assert.Equal(newint[]{4,5,1,2,3},ToArray(result));
3232
}
3333

3434
[Fact]
35-
publicvoidRotateRight_Example2(){
35+
publicvoidRotateRight2(){
3636
varsolution=newSolution();
3737
varhead=BuildList(newint[]{0,1,2});
3838
varresult=solution.RotateRight(head,4);
3939
Assert.Equal(newint[]{2,0,1},ToArray(result));
4040
}
4141

4242
[Fact]
43-
publicvoidRotateRight_Empty(){
43+
publicvoidRotateRight3(){
4444
varsolution=newSolution();
4545
varresult=solution.RotateRight(null,1);
4646
Assert.Null(result);
4747
}
4848

4949
[Fact]
50-
publicvoidRotateRight_SingleNode(){
50+
publicvoidRotateRight4(){
5151
varsolution=newSolution();
5252
varhead=BuildList(newint[]{1});
5353
varresult=solution.RotateRight(head,99);

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

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -4,7 +4,7 @@ namespace LeetCodeNet.G0001_0100.S0063_unique_paths_ii {
44

55
publicclassSolutionTest{
66
[Fact]
7-
publicvoidUniquePathsWithObstacles_Example1(){
7+
publicvoidUniquePathsWithObstacles(){
88
varsolution=newSolution();
99
int[][]grid=newint[][]{
1010
newint[]{0,0,0},
@@ -15,7 +15,7 @@ public void UniquePathsWithObstacles_Example1() {
1515
}
1616

1717
[Fact]
18-
publicvoidUniquePathsWithObstacles_Example2(){
18+
publicvoidUniquePathsWithObstacles2(){
1919
varsolution=newSolution();
2020
int[][]grid=newint[][]{
2121
newint[]{0,1},
@@ -25,7 +25,7 @@ public void UniquePathsWithObstacles_Example2() {
2525
}
2626

2727
[Fact]
28-
publicvoidUniquePathsWithObstacles_AllBlocked(){
28+
publicvoidUniquePathsWithObstacles3(){
2929
varsolution=newSolution();
3030
int[][]grid=newint[][]{
3131
newint[]{1,0},

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

Lines changed: 5 additions & 5 deletions
Original file line numberDiff line numberDiff line change
@@ -4,31 +4,31 @@ namespace LeetCodeNet.G0001_0100.S0066_plus_one {
44

55
publicclassSolutionTest{
66
[Fact]
7-
publicvoidPlusOne_Example1(){
7+
publicvoidPlusOne(){
88
varsolution=newSolution();
99
Assert.Equal(newint[]{1,2,4},solution.PlusOne(newint[]{1,2,3}));
1010
}
1111

1212
[Fact]
13-
publicvoidPlusOne_Example2(){
13+
publicvoidPlusOne2(){
1414
varsolution=newSolution();
1515
Assert.Equal(newint[]{4,3,2,2},solution.PlusOne(newint[]{4,3,2,1}));
1616
}
1717

1818
[Fact]
19-
publicvoidPlusOne_Example3(){
19+
publicvoidPlusOne3(){
2020
varsolution=newSolution();
2121
Assert.Equal(newint[]{1},solution.PlusOne(newint[]{0}));
2222
}
2323

2424
[Fact]
25-
publicvoidPlusOne_Example4(){
25+
publicvoidPlusOne4(){
2626
varsolution=newSolution();
2727
Assert.Equal(newint[]{1,0},solution.PlusOne(newint[]{9}));
2828
}
2929

3030
[Fact]
31-
publicvoidPlusOne_AllNines(){
31+
publicvoidPlusOne5(){
3232
varsolution=newSolution();
3333
Assert.Equal(newint[]{1,0,0,0},solution.PlusOne(newint[]{9,9,9}));
3434
}

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

Lines changed: 4 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -4,25 +4,25 @@ namespace LeetCodeNet.G0001_0100.S0067_add_binary {
44

55
publicclassSolutionTest{
66
[Fact]
7-
publicvoidAddBinary_Example1(){
7+
publicvoidAddBinary(){
88
varsolution=newSolution();
99
Assert.Equal("100",solution.AddBinary("11","1"));
1010
}
1111

1212
[Fact]
13-
publicvoidAddBinary_Example2(){
13+
publicvoidAddBinary2(){
1414
varsolution=newSolution();
1515
Assert.Equal("10101",solution.AddBinary("1010","1011"));
1616
}
1717

1818
[Fact]
19-
publicvoidAddBinary_Zero(){
19+
publicvoidAddBinary3(){
2020
varsolution=newSolution();
2121
Assert.Equal("0",solution.AddBinary("0","0"));
2222
}
2323

2424
[Fact]
25-
publicvoidAddBinary_DifferentLengths(){
25+
publicvoidAddBinary4(){
2626
varsolution=newSolution();
2727
Assert.Equal("1000",solution.AddBinary("1","111"));
2828
}

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

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -5,7 +5,7 @@ namespace LeetCodeNet.G0001_0100.S0068_text_justification {
55

66
publicclassSolutionTest{
77
[Fact]
8-
publicvoidFullJustify_Example1(){
8+
publicvoidFullJustify(){
99
varsolution=newSolution();
1010
varwords=newstring[]{"This","is","an","example","of","text","justification."};
1111
intmaxWidth=16;
@@ -18,7 +18,7 @@ public void FullJustify_Example1() {
1818
}
1919

2020
[Fact]
21-
publicvoidFullJustify_Example2(){
21+
publicvoidFullJustify2(){
2222
varsolution=newSolution();
2323
varwords=newstring[]{"What","must","be","acknowledgment","shall","be"};
2424
intmaxWidth=16;
@@ -31,7 +31,7 @@ public void FullJustify_Example2() {
3131
}
3232

3333
[Fact]
34-
publicvoidFullJustify_Example3(){
34+
publicvoidFullJustify3(){
3535
varsolution=newSolution();
3636
varwords=newstring[]{"Science","is","what","we","understand","well","enough","to","explain","to","a","computer.","Art","is","everything","else","we","do"};
3737
intmaxWidth=20;

0 commit comments

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