hyunkookim 님의 블로그

2218. Maximum Value of K Coins From Piles https://youtu.be/ZRdEd_eun8g?si=nPvl34N3ezdyQO58 백트래킹 솔루션 : 테스트는 통과하나, 시간 제한에 걸림class Solution: def maxValueOfCoins(self, piles: List[List[int]], k: int) -> int: n = len(piles) def dfs(i, coins): if i == n: # 범위 벗어나서. i 는 piles 의 index return 0 res = dfs(i+1, coins) # skip current pile curP..

1220. Count Vowels Permutation https://youtu.be/VUVpTZVa7Ls?si=ebIzPzi9iQeVkNQa class Solution: def countVowelPermutation(self, n: int) -> int: """ Permutation: 순열 / Permutation 아래 규칙을 따르는 n 길이의 순열 개수 계산: Calculate the number of permutations of length `n` following these rules: - 문자열은 a, e, i, o, u로만 구성 / The string consists of only 'a', 'e', 'i', 'o', 'u'. ..

265. Paint House II 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])