Skip to content

Commit

Permalink
Fixed format
Browse files Browse the repository at this point in the history
  • Loading branch information
javadev committed Mar 2, 2025
1 parent e8f9176 commit c86a441
Show file tree
Hide file tree
Showing 5 changed files with 16 additions and 16 deletions.
Original file line number Diff line number Diff line change
Expand Up @@ -24,11 +24,11 @@ class Solution {
var res: Int = max(nums[i], nums[i + 1]) + solve(nums, i + 2, last)
res = min(
res,
max(nums[i], nums[last]) + solve(nums, i + 2, i + 1)
max(nums[i], nums[last]) + solve(nums, i + 2, i + 1),
)
res = min(
res,
max(nums[i + 1], nums[last]) + solve(nums, i + 2, i)
max(nums[i + 1], nums[last]) + solve(nums, i + 2, i),
)
dp[i][last] = res
return res
Expand Down
Original file line number Diff line number Diff line change
Expand Up @@ -9,15 +9,15 @@ internal class SolutionTest {
fun transformArray() {
assertThat<IntArray>(
Solution().transformArray(intArrayOf(4, 3, 2, 1)),
equalTo<IntArray>(intArrayOf(0, 0, 1, 1))
equalTo<IntArray>(intArrayOf(0, 0, 1, 1)),
)
}

@Test
fun transformArray2() {
assertThat<IntArray>(
Solution().transformArray(intArrayOf(1, 5, 1, 4, 2)),
equalTo<IntArray>(intArrayOf(0, 0, 1, 1, 1))
equalTo<IntArray>(intArrayOf(0, 0, 1, 1, 1)),
)
}
}
Original file line number Diff line number Diff line change
Expand Up @@ -11,9 +11,9 @@ internal class SolutionTest {
Solution()
.countArrays(
intArrayOf(1, 2, 3, 4),
arrayOf<IntArray>(intArrayOf(1, 2), intArrayOf(2, 3), intArrayOf(3, 4), intArrayOf(4, 5))
arrayOf<IntArray>(intArrayOf(1, 2), intArrayOf(2, 3), intArrayOf(3, 4), intArrayOf(4, 5)),
),
equalTo<Int>(2)
equalTo<Int>(2),
)
}

Expand All @@ -23,9 +23,9 @@ internal class SolutionTest {
Solution()
.countArrays(
intArrayOf(1, 2, 3, 4),
arrayOf<IntArray>(intArrayOf(1, 10), intArrayOf(2, 9), intArrayOf(3, 8), intArrayOf(4, 7))
arrayOf<IntArray>(intArrayOf(1, 10), intArrayOf(2, 9), intArrayOf(3, 8), intArrayOf(4, 7)),
),
equalTo<Int>(4)
equalTo<Int>(4),
)
}

Expand All @@ -35,9 +35,9 @@ internal class SolutionTest {
Solution()
.countArrays(
intArrayOf(1, 2, 1, 2),
arrayOf<IntArray>(intArrayOf(1, 1), intArrayOf(2, 3), intArrayOf(3, 3), intArrayOf(2, 3))
arrayOf<IntArray>(intArrayOf(1, 1), intArrayOf(2, 3), intArrayOf(3, 3), intArrayOf(2, 3)),
),
equalTo<Int>(0)
equalTo<Int>(0),
)
}
}
Original file line number Diff line number Diff line change
Expand Up @@ -19,7 +19,7 @@ internal class SolutionTest {
fun minCost3() {
assertThat<Int>(
Solution().minCost(intArrayOf(83, 47, 66, 24, 57, 85, 16)),
equalTo<Int>(224)
equalTo<Int>(224),
)
}
}
10 changes: 5 additions & 5 deletions src/test/kotlin/g3401_3500/s3470_permutations_iv/SolutionTest.kt
Original file line number Diff line number Diff line change
Expand Up @@ -9,15 +9,15 @@ internal class SolutionTest {
fun permute() {
MatcherAssert.assertThat<IntArray?>(
Solution().permute(4, 6L),
CoreMatchers.equalTo<IntArray?>(intArrayOf(3, 4, 1, 2))
CoreMatchers.equalTo<IntArray?>(intArrayOf(3, 4, 1, 2)),
)
}

@Test
fun permute2() {
MatcherAssert.assertThat<IntArray?>(
Solution().permute(3, 2L),
CoreMatchers.equalTo<IntArray?>(intArrayOf(3, 2, 1))
CoreMatchers.equalTo<IntArray?>(intArrayOf(3, 2, 1)),
)
}

Expand All @@ -34,9 +34,9 @@ internal class SolutionTest {
intArrayOf(
1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20,
21, 22, 43, 40, 27, 36, 25, 34, 31, 32, 29, 28, 33, 24, 23, 26, 41, 42,
35, 38, 37, 30, 39
)
)
35, 38, 37, 30, 39,
),
),
)
}
}

0 comments on commit c86a441

Please sign in to comment.