动态规划
weixin_45405128
stay hungry, stay foolish.
展开
-
Leetcode-Dynamically Programming-Edit Distance-hard
https://www.youtube.com/watch?v=MiqoA-yF-0M class Solution: def minDistance(self, word1: str, word2: str) -> int: if word1==word2: return 0 dp=[] n=len(w...原创 2020-04-10 13:52:26 · 119 阅读 · 0 评论 -
Leetcode-DP-Coing Change 2
class Solution: def change(self, amount: int, coins: List[int]) -> int: m=len(coins)+1 n=amount+1 dp=[[0]*n for i in range(m)] dp[0][0]=1 for i in range...原创 2020-04-07 18:38:00 · 94 阅读 · 0 评论 -
Leetcode_DP_Unique Jumps
class Solution: def __init__(self): self.memory = {} def uniquePaths(self, m: int, n: int) -> int: if (m,n) in self.memory: return self.memory[(m,n)] ...原创 2020-04-06 23:59:56 · 402 阅读 · 0 评论 -
Leetcode_Dynamic Programming_Jump Game
class Solution: def canJump(self, nums: List[int]) -> bool: n = len(nums) right_most = n - 1 for i in range(n - 2, -1, -1): if i + nums[i] >= right_mos...原创 2020-04-06 22:36:23 · 83 阅读 · 0 评论