Improved tasks 61-68

Author: javadev

LeetCodeNet.Tests/G0001_0100/S0061_rotate_list/SolutionTest.cs

@@ -24,30 +24,30 @@ private int[] ToArray(ListNode head) {
     }
 
     [Fact]
-    public void RotateRight_Example1() {
+    public void RotateRight() {
         var solution = new Solution();
         var head = BuildList(new int[] {1,2,3,4,5});
         var result = solution.RotateRight(head, 2);
         Assert.Equal(new int[] {4,5,1,2,3}, ToArray(result));
     }
 
     [Fact]
-    public void RotateRight_Example2() {
+    public void RotateRight2() {
         var solution = new Solution();
         var head = BuildList(new int[] {0,1,2});
         var result = solution.RotateRight(head, 4);
         Assert.Equal(new int[] {2,0,1}, ToArray(result));
     }
 
     [Fact]
-    public void RotateRight_Empty() {
+    public void RotateRight3() {
         var solution = new Solution();
         var result = solution.RotateRight(null, 1);
         Assert.Null(result);
     }
 
     [Fact]
-    public void RotateRight_SingleNode() {
+    public void RotateRight4() {
         var solution = new Solution();
         var head = BuildList(new int[] {1});
         var result = solution.RotateRight(head, 99);

LeetCodeNet.Tests/G0001_0100/S0063_unique_paths_ii/SolutionTest.cs

@@ -4,7 +4,7 @@ namespace LeetCodeNet.G0001_0100.S0063_unique_paths_ii {
 
 public class SolutionTest {
     [Fact]
-    public void UniquePathsWithObstacles_Example1() {
+    public void UniquePathsWithObstacles() {
         var solution = new Solution();
         int[][] grid = new int[][] {
             new int[] {0,0,0},
@@ -15,7 +15,7 @@ public void UniquePathsWithObstacles_Example1() {
     }
 
     [Fact]
-    public void UniquePathsWithObstacles_Example2() {
+    public void UniquePathsWithObstacles2() {
         var solution = new Solution();
         int[][] grid = new int[][] {
             new int[] {0,1},
@@ -25,7 +25,7 @@ public void UniquePathsWithObstacles_Example2() {
     }
 
     [Fact]
-    public void UniquePathsWithObstacles_AllBlocked() {
+    public void UniquePathsWithObstacles3() {
         var solution = new Solution();
         int[][] grid = new int[][] {
             new int[] {1,0},

LeetCodeNet.Tests/G0001_0100/S0066_plus_one/SolutionTest.cs

@@ -4,31 +4,31 @@ namespace LeetCodeNet.G0001_0100.S0066_plus_one {
 
 public class SolutionTest {
     [Fact]
-    public void PlusOne_Example1() {
+    public void PlusOne() {
         var solution = new Solution();
         Assert.Equal(new int[] {1,2,4}, solution.PlusOne(new int[] {1,2,3}));
     }
 
     [Fact]
-    public void PlusOne_Example2() {
+    public void PlusOne2() {
         var solution = new Solution();
         Assert.Equal(new int[] {4,3,2,2}, solution.PlusOne(new int[] {4,3,2,1}));
     }
 
     [Fact]
-    public void PlusOne_Example3() {
+    public void PlusOne3() {
         var solution = new Solution();
         Assert.Equal(new int[] {1}, solution.PlusOne(new int[] {0}));
     }
 
     [Fact]
-    public void PlusOne_Example4() {
+    public void PlusOne4() {
         var solution = new Solution();
         Assert.Equal(new int[] {1,0}, solution.PlusOne(new int[] {9}));
     }
 
     [Fact]
-    public void PlusOne_AllNines() {
+    public void PlusOne5() {
         var solution = new Solution();
         Assert.Equal(new int[] {1,0,0,0}, solution.PlusOne(new int[] {9,9,9}));
     }

LeetCodeNet.Tests/G0001_0100/S0067_add_binary/SolutionTest.cs

@@ -4,25 +4,25 @@ namespace LeetCodeNet.G0001_0100.S0067_add_binary {
 
 public class SolutionTest {
     [Fact]
-    public void AddBinary_Example1() {
+    public void AddBinary() {
         var solution = new Solution();
         Assert.Equal("100", solution.AddBinary("11", "1"));
     }
 
     [Fact]
-    public void AddBinary_Example2() {
+    public void AddBinary2() {
         var solution = new Solution();
         Assert.Equal("10101", solution.AddBinary("1010", "1011"));
     }
 
     [Fact]
-    public void AddBinary_Zero() {
+    public void AddBinary3() {
         var solution = new Solution();
         Assert.Equal("0", solution.AddBinary("0", "0"));
     }
 
     [Fact]
-    public void AddBinary_DifferentLengths() {
+    public void AddBinary4() {
         var solution = new Solution();
         Assert.Equal("1000", solution.AddBinary("1", "111"));
     }

LeetCodeNet.Tests/G0001_0100/S0068_text_justification/SolutionTest.cs

@@ -5,7 +5,7 @@ namespace LeetCodeNet.G0001_0100.S0068_text_justification {
 
 public class SolutionTest {
     [Fact]
-    public void FullJustify_Example1() {
+    public void FullJustify() {
         var solution = new Solution();
         var words = new string[] {"This", "is", "an", "example", "of", "text", "justification."};
         int maxWidth = 16;
@@ -18,7 +18,7 @@ public void FullJustify_Example1() {
     }
 
     [Fact]
-    public void FullJustify_Example2() {
+    public void FullJustify2() {
         var solution = new Solution();
         var words = new string[] {"What","must","be","acknowledgment","shall","be"};
         int maxWidth = 16;
@@ -31,7 +31,7 @@ public void FullJustify_Example2() {
     }
 
     [Fact]
-    public void FullJustify_Example3() {
+    public void FullJustify3() {
         var solution = new Solution();
         var words = new string[] {"Science","is","what","we","understand","well","enough","to","explain","to","a","computer.","Art","is","everything","else","we","do"};
         int maxWidth = 20;