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...
动态规划 (Dynamic Programming - DP): 这是算法学习中的一个难点,也是重点。 核心思想: 理解 DP 的两大性质:最优子结构 (Optimal Substructure) 和重叠子问题 (Overlapping Subproblems)。掌握定义状态 (state)、寻找状态转移方程 (state transition equation) 的方法。 由易到难: 从一维 DP 开始,如斐波那契数列...
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...
📕 Dynamic Programming | HackerEarth) 📒 Disjoint Set Union (Union Find) | HackerEarth 📕 Ternary Search | HackerEarth 📒 Binary Search for Beginners | Leetcode 🏆 Sources Other coding websites, hackerearth, interviewbit,gfg, leetcode, codechef, codeforces, CSES Problem Set, Scaler Youtub...
Study Plan Dynamic Programming 动态规划 Day 1 Day 2 Day 3 Other ALL #题名Name难度编程语言 0001两数之和Two Sum简单Java 0002两数相加Add Two Numbers中等 0003无重复字符的最长子串Longest Substring Without Repeating Characters中等 0003无重复字符的最长子串longest-substring-without-repeating-charactersMediumjav...
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.稀疏...
到 1 - 学习计划 - 力扣（LeetCode）全球极客挚爱的技术成长平台leetcode.cn/studyplan/programming...
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 ...