hyunkookim 님의 블로그

256. Paint House 내 풀이 (맞춤)class Solution: def minCost(self, costs: List[List[int]]) -> int: n = len(costs) dp = [[0]*3 for _ in range(n)] dp[-1][:] = costs[-1][:] if n > 1: for r in range(n-1-1, -1, -1): for c in range(3): dp[r][c%3] = min(dp[r+1][(c+1)%3], dp[r+1][(c+2)%3]) + costs[r][c%3] #print(dp) ..

983. Minimum Cost For Tickets https://youtu.be/4pY1bsBpIY4?si=PbuLW3CZC5vqdJDg class Solution: def mincostTickets(self, days: List[int], costs: List[int]) -> int: dp = {} def dfs(i): if i == len(days): return 0 if i in dp: return dp[i] dp[i] = float("inf") # d: # of days, c: cost for d, c in zip..

91. Decode Ways https://youtu.be/6aEyTjOwlJU?si=gOHrfB_eRCdonSuR class Solution: def numDecodings(self, s: str) -> int: dp = {len(s) : 1} def dfs(i): if i in dp: return dp[i] if s[i] == "0": return 0 res = dfs(i+1) if (i+1  class Solution: def numDecodings(self, s: str) -> int: dp = {len(s) : 1} ..

2466. Count Ways To Build Good Strings https://youtu.be/JKpVHG2mhbk?si=3Ak7-dfYaYnRK9AZ class Solution: def countGoodStrings(self, low: int, high: int, zero: int, one: int) -> int: mod = 10**9 + 7 dp = {} def dfs(length): if length > high: return 0 if length in dp: return dp[length] # if low = low else 0 ..