dynamic_program

动态规划专题魔鬼训练营，start from 20210104

题目	描述	思路	归类	解题时间
338.counting-bits	比特位计数	-	动态规划	2021-01-04
139.word-break	单词拆分	dp[i]表示第i位时，是否可以被拆分，dp[i]是否可以被拆分取决于0:j组成的字符串是否可以被拆分以及s[j:i-1]在wordDict中，所以递推表达式是dp[i] = dp[j] && check_s_in_dict(s[i:j-1]), 初始化的dp[0]=True	动态规划	2021-01-25
62.
309.
5.

Name	Name	Last commit message	Last commit date
parent directory ..
120-triangle.py	120-triangle.py
121-best-time-to-buy-and-sell-stock.py	121-best-time-to-buy-and-sell-stock.py
131-palindrome-partitioning.py	131-palindrome-partitioning.py
139-word-break.py	139-word-break.py
198-house-robber.py	198-house-robber.py
300-longest-increasing-subsequence.py	300-longest-increasing-subsequence.py
309-best-time-to-buy-and-sell-stock-with-cooldown.py	309-best-time-to-buy-and-sell-stock-with-cooldown.py
322-coin-change.py	322-coin-change.py
338-counting-bits.py	338-counting-bits.py
376-wiggle-subsequence.py	376-wiggle-subsequence.py
392-is-subsequence.py	392-is-subsequence.py
45-jump-game-ii.py	45-jump-game-ii.py
5-longest-palindromic-substring.py	5-longest-palindromic-substring.py
516-longest-palindromic-subsequence.py	516-longest-palindromic-subsequence.py
518-coin-change-2.py	518-coin-change-2.py
55-jump-game.py	55-jump-game.py
62-unique-paths.py	62-unique-paths.py
63-unique-paths-ii.py	63-unique-paths-ii.py
64-minimum-path-sum.py	64-minimum-path-sum.py
72-edit-distance.py	72-edit-distance.py
96-unique-binary-search-trees.py	96-unique-binary-search-trees.py
Readme.md	Readme.md

Provide feedback