feat(content): more test cases
This commit is contained in:
@@ -9,6 +9,28 @@ categories:
|
||||
patterns:
|
||||
- dynamic-programming
|
||||
|
||||
function_signature: "def max_coins(nums: list[int]) -> int:"
|
||||
|
||||
test_cases:
|
||||
visible:
|
||||
- input: { nums: [3, 1, 5, 8] }
|
||||
expected: 167
|
||||
- input: { nums: [1, 5] }
|
||||
expected: 10
|
||||
hidden:
|
||||
- input: { nums: [1] }
|
||||
expected: 1
|
||||
- input: { nums: [9, 76, 64, 21] }
|
||||
expected: 116718
|
||||
- input: { nums: [5, 7, 8] }
|
||||
expected: 329
|
||||
- input: { nums: [7, 9, 8, 0, 7, 1, 3, 5, 5, 2, 3] }
|
||||
expected: 1654
|
||||
- input: { nums: [35, 16, 83, 87, 32, 45, 81, 26] }
|
||||
expected: 1310780
|
||||
- input: { nums: [8, 2, 6, 8, 9, 8, 1, 4, 1, 5, 3, 0, 7, 7, 0, 4, 2, 2, 5] }
|
||||
expected: 3630
|
||||
|
||||
description: |
|
||||
You are given `n` balloons, indexed from `0` to `n - 1`. Each balloon is painted with a number on it represented by an array `nums`. You are asked to burst all the balloons.
|
||||
|
||||
|
||||
Reference in New Issue
Block a user