前言
这段话引用自这位佬
在树形动态规划当中,我们一般先算子树再进行合并,在实现上与树的后序遍历相似,都是先遍历子树,遍历完之后将子树的值传给父亲。简单来说我们动态规划的过程大概就是先递归访问所有子树,再在根上合并
那可能就有人会问了,这不就是树的后序遍历吗?递归计算完所有子树后将值返回给父节点,跟DP有啥子关系?
其实是因为在很多此类问题中,很多时候会产生重复的计算(递归的通病),所以我们需要将计算结果记忆化,以减少计算量
我的个人理解是 树形DP = DFS+剪枝
下面用一道例题解释
例题 1 字符串树形DP
139. Word Break
给定一个字符串s和一个字符串字典wordDict,如果s可以被分割成一个或多个字典单词的空格分隔序列,则返回true。
请注意,词典中的同一个单词可能会在切分中重复使用多次。
Example 1:
Input: s = "leetcode", wordDict = ["leet","code"]
Output: true
Explanation: Return true because "leetcode" can be segmented as "leet code".
Example 2:
Input: s = "applepenapple", wordDict = ["apple","pen"]
Output: true
Explanation: Return true because "applepenapple" can be segmented as "apple pen apple".
Note that you are allowed to reuse a dictionary word.
Example 3:
Input: s = "catsandog", wordDict = ["cats","dog","sand","and","cat"]
Output: false
DFS剪枝(树形DP)
class Solution {
public:
bool recur(int start, string s, unordered_set<string>& word, vector<char>& mem){
int n = s.size();
if(start==n)return true;
if(mem[start] != -1)return mem[start];
string sub;
for(int i=start; i<n; i++)
if(word.count(sub+=s[i]) && recur(i+1, s, word, mem))
return mem[start]=