动态规划
算法-动态规划
三块桌布
这个作者很懒,什么都没留下…
展开
-
lc 140.hard单词拆分II【①动态规划->lc139.单词拆分;②*****枚举 - 回溯法】
官方题解https://leetcode-cn.com/problems/word-break-ii/solution/dan-ci-chai-fen-ii-by-leetcode-solution/抄答案:class Solution {public: unordered_set<string> wordDictSet; unordered_map<int, vector<string>> sen; //记录每个下标对应的字符 以它开头..原创 2020-11-01 23:20:02 · 144 阅读 · 0 评论 -
lc 139.middle单词拆分【****动态规划】
官方题解【动态规划】https://leetcode-cn.com/problems/word-break/solution/dan-ci-chai-fen-by-leetcode-solution/class Solution {public: bool wordBreak(string s, vector<string>& wordDict) { unordered_set<string> wordDictSet; fo..原创 2020-11-01 23:14:25 · 220 阅读 · 0 评论 -
lc 834.树中距离之和【*****树形DP】
看了这个题解看懂了https://leetcode-cn.com/problems/sum-of-distances-in-tree/solution/c-liang-ci-dfsde-dao-da-an-by-congwang357-2/核心就在这里:※求出递推式;※先使用后序遍历求出ans[root]和所有cnt[i],然后使用前序遍历用ans[node]求出ans[node的孩子];※使用用数组存储邻接点的方式存储图。class Solution {public: ..原创 2020-10-07 23:19:54 · 108 阅读 · 0 评论 -
LCP 19.秋叶收藏集【*****动态规划】
官方题解https://leetcode-cn.com/problems/UlBDOe/solution/qiu-xie-shou-cang-ji-by-leetcode-solution/class Solution {public: int minimumOperations(string leaves) { int n=leaves.size(); int f[n][3]; f[0][0]=(leaves[0]=='y'), f...原创 2020-10-04 20:11:15 · 63 阅读 · 0 评论 -
lc968.监控二叉树【递归,*****状态转移&树形动态规划DP(dynamic programming)】
题解一https://leetcode-cn.com/problems/binary-tree-cameras/solution/shou-hua-tu-jie-cong-di-gui-you-hua-dao-dong-tai-g/核心:由左右孩子的abc三个值,得到node的abc,如此往下递归/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *l...原创 2020-09-22 23:45:22 · 226 阅读 · 0 评论