Skip to content

Commit 03a6cfe

Browse files
committed
Fixed style
1 parent afdeeb8 commit 03a6cfe

File tree

7 files changed

+45
-39
lines changed

7 files changed

+45
-39
lines changed

src/main/kotlin/g3501_3600/s3544_subtree_inversion_sum/Solution.kt

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -52,11 +52,11 @@ class Solution {
5252
res[0][0] = totalSum[cur]
5353
res[1][0] = min(
5454
min(maxCandWithoutInv, maxCandWithInv),
55-
min(minCandWithoutInv, minCandWithInv)
55+
min(minCandWithoutInv, minCandWithInv),
5656
)
5757
res[2][0] = max(
5858
max(maxCandWithoutInv, maxCandWithInv),
59-
max(minCandWithoutInv, minCandWithInv)
59+
max(minCandWithoutInv, minCandWithInv),
6060
)
6161
return res
6262
}

src/test/kotlin/g3501_3600/s3542_minimum_operations_to_convert_all_elements_to_zero/SolutionTest.kt

Lines changed: 4 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -7,19 +7,19 @@ import org.junit.jupiter.api.Test
77
internal class SolutionTest {
88
@Test
99
fun minOperations() {
10-
MatcherAssert.assertThat<Int?>(Solution().minOperations(intArrayOf(0, 2)), CoreMatchers.equalTo<Int?>(1))
10+
MatcherAssert.assertThat<Int>(Solution().minOperations(intArrayOf(0, 2)), CoreMatchers.equalTo<Int>(1))
1111
}
1212

1313
@Test
1414
fun minOperations2() {
15-
MatcherAssert.assertThat<Int?>(Solution().minOperations(intArrayOf(3, 1, 2, 1)), CoreMatchers.equalTo<Int?>(3))
15+
MatcherAssert.assertThat<Int>(Solution().minOperations(intArrayOf(3, 1, 2, 1)), CoreMatchers.equalTo<Int>(3))
1616
}
1717

1818
@Test
1919
fun minOperations3() {
20-
MatcherAssert.assertThat<Int?>(
20+
MatcherAssert.assertThat<Int>(
2121
Solution().minOperations(intArrayOf(1, 2, 1, 2, 1, 2)),
22-
CoreMatchers.equalTo<Int?>(4)
22+
CoreMatchers.equalTo<Int>(4),
2323
)
2424
}
2525
}

src/test/kotlin/g3501_3600/s3543_maximum_weighted_k_edge_path/SolutionTest.kt

Lines changed: 4 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -9,31 +9,31 @@ internal class SolutionTest {
99
fun maxWeight() {
1010
assertThat<Int>(
1111
Solution().maxWeight(3, arrayOf<IntArray>(intArrayOf(0, 1, 1), intArrayOf(1, 2, 2)), 2, 4),
12-
equalTo<Int>(3)
12+
equalTo<Int>(3),
1313
)
1414
}
1515

1616
@Test
1717
fun maxWeight2() {
1818
assertThat<Int>(
1919
Solution().maxWeight(3, arrayOf<IntArray>(intArrayOf(0, 1, 2), intArrayOf(0, 2, 3)), 1, 3),
20-
equalTo<Int>(2)
20+
equalTo<Int>(2),
2121
)
2222
}
2323

2424
@Test
2525
fun maxWeight3() {
2626
assertThat<Int>(
2727
Solution().maxWeight(3, arrayOf<IntArray>(intArrayOf(0, 1, 6), intArrayOf(1, 2, 8)), 1, 6),
28-
equalTo<Int>(-1)
28+
equalTo<Int>(-1),
2929
)
3030
}
3131

3232
@Test
3333
fun maxWeight4() {
3434
assertThat<Int>(
3535
Solution().maxWeight(3, arrayOf<IntArray>(intArrayOf(0, 1, 6), intArrayOf(1, 2, 8)), 0, 6),
36-
equalTo<Int>(0)
36+
equalTo<Int>(0),
3737
)
3838
}
3939
}

src/test/kotlin/g3501_3600/s3544_subtree_inversion_sum/SolutionTest.kt

Lines changed: 9 additions & 7 deletions
Original file line numberDiff line numberDiff line change
@@ -16,12 +16,12 @@ internal class SolutionTest {
1616
intArrayOf(1, 3),
1717
intArrayOf(1, 4),
1818
intArrayOf(2, 5),
19-
intArrayOf(2, 6)
19+
intArrayOf(2, 6),
2020
),
2121
intArrayOf(4, -8, -6, 3, 7, -2, 5),
22-
2
22+
2,
2323
),
24-
equalTo<Long>(27L)
24+
equalTo<Long>(27L),
2525
)
2626
}
2727

@@ -32,9 +32,9 @@ internal class SolutionTest {
3232
.subtreeInversionSum(
3333
arrayOf<IntArray>(intArrayOf(0, 1), intArrayOf(1, 2), intArrayOf(2, 3), intArrayOf(3, 4)),
3434
intArrayOf(-1, 3, -2, 4, -5),
35-
2
35+
2,
3636
),
37-
equalTo<Long>(9L)
37+
equalTo<Long>(9L),
3838
)
3939
}
4040

@@ -43,9 +43,11 @@ internal class SolutionTest {
4343
assertThat<Long>(
4444
Solution()
4545
.subtreeInversionSum(
46-
arrayOf<IntArray>(intArrayOf(0, 1), intArrayOf(0, 2)), intArrayOf(0, -1, -2), 3
46+
arrayOf<IntArray>(intArrayOf(0, 1), intArrayOf(0, 2)),
47+
intArrayOf(0, -1, -2),
48+
3,
4749
),
48-
equalTo<Long>(3L)
50+
equalTo<Long>(3L),
4951
)
5052
}
5153
}

src/test/kotlin/g3501_3600/s3546_equal_sum_grid_partition_i/SolutionTest.kt

Lines changed: 9 additions & 7 deletions
Original file line numberDiff line numberDiff line change
@@ -11,9 +11,10 @@ internal class SolutionTest {
1111
Solution().canPartitionGrid(
1212
arrayOf<IntArray>(
1313
intArrayOf(1, 4),
14-
intArrayOf(2, 3)
15-
)
16-
), equalTo<Boolean>(true)
14+
intArrayOf(2, 3),
15+
),
16+
),
17+
equalTo<Boolean>(true),
1718
)
1819
}
1920

@@ -23,17 +24,18 @@ internal class SolutionTest {
2324
Solution().canPartitionGrid(
2425
arrayOf<IntArray>(
2526
intArrayOf(1, 3),
26-
intArrayOf(2, 4)
27-
)
28-
), equalTo<Boolean>(false)
27+
intArrayOf(2, 4),
28+
),
29+
),
30+
equalTo<Boolean>(false),
2931
)
3032
}
3133

3234
@Test
3335
fun canPartitionGrid3() {
3436
assertThat<Boolean>(
3537
Solution().canPartitionGrid(arrayOf<IntArray>(intArrayOf(1))),
36-
equalTo<Boolean>(false)
38+
equalTo<Boolean>(false),
3739
)
3840
}
3941
}

src/test/kotlin/g3501_3600/s3547_maximum_sum_of_edge_values_in_a_graph/SolutionTest.kt

Lines changed: 6 additions & 6 deletions
Original file line numberDiff line numberDiff line change
@@ -17,10 +17,10 @@ internal class SolutionTest {
1717
intArrayOf(2, 0),
1818
intArrayOf(3, 4),
1919
intArrayOf(4, 5),
20-
intArrayOf(5, 6)
21-
)
20+
intArrayOf(5, 6),
21+
),
2222
),
23-
equalTo<Long>(130L)
23+
equalTo<Long>(130L),
2424
)
2525
}
2626

@@ -36,10 +36,10 @@ internal class SolutionTest {
3636
intArrayOf(2, 0),
3737
intArrayOf(1, 3),
3838
intArrayOf(2, 4),
39-
intArrayOf(1, 5)
40-
)
39+
intArrayOf(1, 5),
40+
),
4141
),
42-
equalTo<Long>(82L)
42+
equalTo<Long>(82L),
4343
)
4444
}
4545
}

src/test/kotlin/g3501_3600/s3548_equal_sum_grid_partition_ii/SolutionTest.kt

Lines changed: 11 additions & 9 deletions
Original file line numberDiff line numberDiff line change
@@ -11,9 +11,10 @@ internal class SolutionTest {
1111
Solution().canPartitionGrid(
1212
arrayOf<IntArray>(
1313
intArrayOf(1, 4),
14-
intArrayOf(2, 3)
15-
)
16-
), equalTo<Boolean>(true)
14+
intArrayOf(2, 3),
15+
),
16+
),
17+
equalTo<Boolean>(true),
1718
)
1819
}
1920

@@ -23,33 +24,34 @@ internal class SolutionTest {
2324
Solution().canPartitionGrid(
2425
arrayOf<IntArray>(
2526
intArrayOf(1, 2),
26-
intArrayOf(3, 4)
27-
)
28-
), equalTo<Boolean>(true)
27+
intArrayOf(3, 4),
28+
),
29+
),
30+
equalTo<Boolean>(true),
2931
)
3032
}
3133

3234
@Test
3335
fun canPartitionGrid3() {
3436
assertThat<Boolean>(
3537
Solution().canPartitionGrid(arrayOf<IntArray>(intArrayOf(1, 2, 4), intArrayOf(2, 3, 5))),
36-
equalTo<Boolean>(false)
38+
equalTo<Boolean>(false),
3739
)
3840
}
3941

4042
@Test
4143
fun canPartitionGrid4() {
4244
assertThat<Boolean>(
4345
Solution().canPartitionGrid(arrayOf<IntArray>(intArrayOf(4, 1, 8), intArrayOf(3, 2, 6))),
44-
equalTo<Boolean>(false)
46+
equalTo<Boolean>(false),
4547
)
4648
}
4749

4850
@Test
4951
fun canPartitionGrid5() {
5052
assertThat<Boolean>(
5153
Solution().canPartitionGrid(arrayOf<IntArray>(intArrayOf(1))),
52-
equalTo<Boolean>(false)
54+
equalTo<Boolean>(false),
5355
)
5456
}
5557
}

0 commit comments

Comments
 (0)