https://leetcode.cn/problems/house-robber/solutions/138131/dong-tai-gui-hua-jie-ti-si-bu-zou-xiang-jie-cjavap/?envType=study-plan-v2&envId=dynamic-programming 动态规划的方法,最关键的在于找出f(n),和f(n-1),f(n-2)的关系,在n时,要不就是f(n-1)的方法,或者f(n-2) + nums[-1] cla...
Study PlanSee all Array1860 String771 Hash Table672 Dynamic Programming571 Math563 Sorting444 Greedy406 Depth-First Search312 Binary Search302 Database300 Matrix249 Tree240 Breadth-First Search239 Bit Manipulation233 Two Pointers216 Prefix Sum194 Heap (Priority Queue)189 Binary Tree176 Simulation173 ...
Dynamic Programming Design Math Others Top InterView Question Medium Top InterView Question Hard Study Plan Dynamic Programming 动态规划 Day 1 Day 2 Day 3 Other LeetCode-CN https://leetcode-cn.com/tzzs/ LeetCode-CN ALL ProblemSet 剑指Offer ...
LeetCode 热题 100 - 学习计划 - 力扣（LeetCode）全球极客挚爱的技术成长平台leetcode.cn/studyp...
Dynamic programming Backtracking ✅ Depth First Search Breadth First Search Binary Search Math Hash Table Sort ✅ Bit Manipulation ✅ Union Find ✅ Sliding Window ✅ Segment Tree ✅ Binary Indexed Tree ✅ 数据结构变种相关题目 顺序线性表:向量 单链表 1.双链表2.静态链表3.对称矩阵4.稀疏...
functional-programming-jargon Jargon from the functional programming world in simple terms! coding-interview-university A complete computer science study plan to become a software engineer. awesome-webpack-cn 印记中文 - webpack 优秀中文文章 free-programming-books 📚 Freely available programming books ...
Problems Contest Discuss Interview Store Study PlanSee all Array1872 String776 Hash Table682 Dynamic Programming573 Math565 Sorting445 Greedy406 Depth-First Search315 Binary Search303 Database301 Matrix250 Breadth-First Search241 Tree241 Bit Manipulation234 Two Pointers216 Prefix Sum196 Heap (Priority...