花花酱 0-1 Knapsack Problem 01背包问题 - 刷题找工作 SP10
图书推荐:
算法 Introduction to Algorithms https://amzn.to/2T42fmA
软件工程 The Mythical Man-Month https://amzn.to/2qH8Zdm
面经 Cracking the Coding Interview https://amzn.to/2PTHqvi
代码 (Solution)
https://zxi.mytechroad.com/blog/sp/knapsack-problem/
题目分类: DP
动态规划 (Dynamic programming) https://www.youtube.com/watch?v=MSNSqU3BnXk&list=PLLuMmzMTgVK7vEbeHBDD42pqqG36jhuOr
递归 (Recursion) https://www.youtube.com/watch?v=C75nVjzsT9g&list=PLLuMmzMTgVK45AiaeeEGGc6xqM6jrlXL4
设计/数据结构 (Design/Data Structure) https://www.youtube.com/watch?v=JL4OjKV_pGE&list=PLLuMmzMTgVK6M8XmintFnrd1VN-VBc0t0
树 (Binary Tree) https://www.youtube.com/watch?v=L_t2x3nH61k&list=PLLuMmzMTgVK7ug02DDoQsf50OtwVDL1xd
搜索 (Search) https://www.youtube.com/watch?v=oUeGFKZvoo4&list=PLLuMmzMTgVK423Mj1n_OaOAZZ6k5fNxyN
图 (graph) https://www.youtube.com/watch?v=Qqgck2ijUjU&list=PLLuMmzMTgVK5gFVMpryw0LkJp4l9WTtdM&index=1
哈希表 (HashTable) https://www.youtube.com/watch?v=tNtk_rwbaIk&list=PLLuMmzMTgVK48qe6jxrVW-FHNrm7g5mop
贪心 (Greedy) https://www.youtube.com/watch?v=3kJpg7Smc3E&list=PLLuMmzMTgVK5Igci8P3d88XpoyeIA1Fl-
链表 (Linked List) https://www.youtube.com/watch?v=bxCb37nLXWM&list=PLLuMmzMTgVK6a-2aAwPieEIIuIJY6JTSq
数学题 (Math) https://www.youtube.com/watch?v=ddFvTWmVUEA&list=PLLuMmzMTgVK70LRovZHZwfRaMTboc6Xdc
几何 (Geometry) https://www.youtube.com/watch?v=8Kd-Tn_Rz7s&list=PLLuMmzMTgVK6b1bJ4eovW1u_vrRE6mK6Q
字符串 (String) https://www.youtube.com/watch?v=fZ8nkk220M4&list=PLLuMmzMTgVK49Hph4vV8DAzGZpj4azwmz
模拟 (Simulation) https://www.youtube.com/watch?v=Vp5qRtuyln4&list=PLLuMmzMTgVK7nhHbo-hE60XDciDX62HvR
分治 (Divide and Conquer) https://www.youtube.com/watch?v=LPIvL-jvGdA&list=PLLuMmzMTgVK5DkeNodml9CHCW4BGxpci7
二分搜索(Binary Search) https://www.youtube.com/watch?v=nxJXnQ7wLhM&list=PLLuMmzMTgVK74vqU7Ukaf70a382dzF3Uo
Bit (位运算) https://www.youtube.com/watch?v=fH9clXXrS2Q&list=PLLuMmzMTgVK7t8spH-USywHZLtt2aM5Ue
所有题目 (All) https://www.youtube.com/watch?v=A6iCX_5xiU4&list=PLLuMmzMTgVK66JImslfqAJLovRAyQKAas
By Difficulty:
* Easy: https://www.youtube.com/watch?v=rRMdxFA-8G4&list=PLLuMmzMTgVK7eabhqdNs1wQv0cFEbd048
* Medium: https://www.youtube.com/watch?v=seQnf-5hlBo&list=PLLuMmzMTgVK6-w5poVP89Kl38S9UryDHx
* Hard: https://www.youtube.com/watch?v=UjiFFYU3EKM&list=PLLuMmzMTgVK6qfhuW2tarjHgHh3G8XpUF
题目列表 (All): http://t.cn/RTcVHnY
Видео 花花酱 0-1 Knapsack Problem 01背包问题 - 刷题找工作 SP10 канала Hua Hua
算法 Introduction to Algorithms https://amzn.to/2T42fmA
软件工程 The Mythical Man-Month https://amzn.to/2qH8Zdm
面经 Cracking the Coding Interview https://amzn.to/2PTHqvi
代码 (Solution)
https://zxi.mytechroad.com/blog/sp/knapsack-problem/
题目分类: DP
动态规划 (Dynamic programming) https://www.youtube.com/watch?v=MSNSqU3BnXk&list=PLLuMmzMTgVK7vEbeHBDD42pqqG36jhuOr
递归 (Recursion) https://www.youtube.com/watch?v=C75nVjzsT9g&list=PLLuMmzMTgVK45AiaeeEGGc6xqM6jrlXL4
设计/数据结构 (Design/Data Structure) https://www.youtube.com/watch?v=JL4OjKV_pGE&list=PLLuMmzMTgVK6M8XmintFnrd1VN-VBc0t0
树 (Binary Tree) https://www.youtube.com/watch?v=L_t2x3nH61k&list=PLLuMmzMTgVK7ug02DDoQsf50OtwVDL1xd
搜索 (Search) https://www.youtube.com/watch?v=oUeGFKZvoo4&list=PLLuMmzMTgVK423Mj1n_OaOAZZ6k5fNxyN
图 (graph) https://www.youtube.com/watch?v=Qqgck2ijUjU&list=PLLuMmzMTgVK5gFVMpryw0LkJp4l9WTtdM&index=1
哈希表 (HashTable) https://www.youtube.com/watch?v=tNtk_rwbaIk&list=PLLuMmzMTgVK48qe6jxrVW-FHNrm7g5mop
贪心 (Greedy) https://www.youtube.com/watch?v=3kJpg7Smc3E&list=PLLuMmzMTgVK5Igci8P3d88XpoyeIA1Fl-
链表 (Linked List) https://www.youtube.com/watch?v=bxCb37nLXWM&list=PLLuMmzMTgVK6a-2aAwPieEIIuIJY6JTSq
数学题 (Math) https://www.youtube.com/watch?v=ddFvTWmVUEA&list=PLLuMmzMTgVK70LRovZHZwfRaMTboc6Xdc
几何 (Geometry) https://www.youtube.com/watch?v=8Kd-Tn_Rz7s&list=PLLuMmzMTgVK6b1bJ4eovW1u_vrRE6mK6Q
字符串 (String) https://www.youtube.com/watch?v=fZ8nkk220M4&list=PLLuMmzMTgVK49Hph4vV8DAzGZpj4azwmz
模拟 (Simulation) https://www.youtube.com/watch?v=Vp5qRtuyln4&list=PLLuMmzMTgVK7nhHbo-hE60XDciDX62HvR
分治 (Divide and Conquer) https://www.youtube.com/watch?v=LPIvL-jvGdA&list=PLLuMmzMTgVK5DkeNodml9CHCW4BGxpci7
二分搜索(Binary Search) https://www.youtube.com/watch?v=nxJXnQ7wLhM&list=PLLuMmzMTgVK74vqU7Ukaf70a382dzF3Uo
Bit (位运算) https://www.youtube.com/watch?v=fH9clXXrS2Q&list=PLLuMmzMTgVK7t8spH-USywHZLtt2aM5Ue
所有题目 (All) https://www.youtube.com/watch?v=A6iCX_5xiU4&list=PLLuMmzMTgVK66JImslfqAJLovRAyQKAas
By Difficulty:
* Easy: https://www.youtube.com/watch?v=rRMdxFA-8G4&list=PLLuMmzMTgVK7eabhqdNs1wQv0cFEbd048
* Medium: https://www.youtube.com/watch?v=seQnf-5hlBo&list=PLLuMmzMTgVK6-w5poVP89Kl38S9UryDHx
* Hard: https://www.youtube.com/watch?v=UjiFFYU3EKM&list=PLLuMmzMTgVK6qfhuW2tarjHgHh3G8XpUF
题目列表 (All): http://t.cn/RTcVHnY
Видео 花花酱 0-1 Knapsack Problem 01背包问题 - 刷题找工作 SP10 канала Hua Hua
Показать
Комментарии отсутствуют
Информация о видео
Другие видео канала
花花酱 Knapsack Problem 背包问题 2 - 刷题找工作 SP11科学很美——博弈论总结篇,李永乐老师海绵演讲(2018最新)0-1 Knapsack Problem (Dynamic Programming)花花酱 线程与进程 并行计算1 - CS大讲堂 EP1The 6 Core Recursive Patterns for Interviewing如何最快速的刷题(官方网站:cspiration.com)The 0/1 Knapsack Problem - Dynamic Programming Method花花酱 LeetCode 309. Best Time to Buy and Sell Stock with Cooldown - 刷题找工作 EP150【动态规划专题班】动态规划入门 Introduction to Dynamic Programming花花酱 LeetCode进入千题时代 该如何刷题?1/2 - 刷题找工作 SP15The 0/1 Knapsack Problem (Demystifying Dynamic Programming)【经典算法】01背包问题米开:LeetCode 489. Robot Room Cleaner花花酱 LeetCode DP1 - 刷题找工作 SP8花花酱 LeetCode 732. My Calendar III - 刷题找工作 EP126花花酱 LeetCode 470. Implement Rand10() Using Rand7() - 刷题找工作 EP226How to Understand Any Recursive Code背包九讲问题(上)What Is Dynamic Programming and How To Use It