dotnet format

si618 · si618 · commit 9bb9be7c8de9 · 2024-10-13T15:37:13.000+10:30
diff --git a/LeetCode.CSharp/Problems/AddTwoNumbers.cs b/LeetCode.CSharp/Problems/AddTwoNumbers.cs
@@ -48,7 +48,7 @@ public static ListNode AddTwoNumbers(ListNode l1, ListNode l2)
 
     [Theory]
     [InlineData(new[] { 2, 4, 3 }, new[] { 5, 6, 4 }, new[] { 7, 0, 8 })]
-    [InlineData(new int[] {}, new int[] {}, new int[] {})]
+    [InlineData(new int[] { }, new int[] { }, new int[] { })]
     [InlineData(
         new[] { 9, 9, 9, 9, 9, 9, 9 },
         new[] { 9, 9, 9, 9 },
diff --git a/LeetCode.CSharp/Problems/BinarySearch.cs b/LeetCode.CSharp/Problems/BinarySearch.cs
@@ -38,7 +38,7 @@ public static int BinarySearch(int[] nums, int target)
     [Theory]
     [InlineData(new[] { -1, 0, 3, 5, 9, 12 }, 9, 4)]
     [InlineData(new[] { -1, 0, 3, 5, 9, 12 }, 2, -1)]
-    [InlineData(new int[] {}, 0, -1)]
+    [InlineData(new int[] { }, 0, -1)]
     public void BinarySearchTest(int[] nums, int target, int expected) =>
         BinarySearch(nums, target).Should().Be(expected);
 }

Original file line number	Diff line number	Diff line change
`@@ -38,7 +38,7 @@ public static int BinarySearch(int[] nums, int target)`
`38`	`38`	`[Theory]`
`39`	`39`	`[InlineData(new[] { -1, 0, 3, 5, 9, 12 }, 9, 4)]`
`40`	`40`	`[InlineData(new[] { -1, 0, 3, 5, 9, 12 }, 2, -1)]`
`41`		`- [InlineData(new int[] {}, 0, -1)]`
	`41`	`+ [InlineData(new int[] { }, 0, -1)]`
`42`	`42`	`public void BinarySearchTest(int[] nums, int target, int expected) =>`
`43`	`43`	`BinarySearch(nums, target).Should().Be(expected);`
`44`	`44`	`}`