class Solution:
def minCostII(self, costs: List[List[int]]) -> int:
N = len(costs)
K = len(costs[0])
for n in range(N-1-1, -1, -1):
for k in range(K):
costs[n][k] += min([costs[n+1][i] for i in range(K) if i != k])
return min(costs[0])'LeetCode > DP심화' 카테고리의 다른 글
| 2218. Maximum Value of K Coins From Piles (0) | 2025.01.14 |
|---|---|
| 1220. Count Vowels Permutation (0) | 2025.01.14 |
| 256. Paint House (0) | 2025.01.13 |
| 983. Minimum Cost For Tickets (0) | 2025.01.13 |
| 91. Decode Ways (0) | 2025.01.13 |