https://pluv27.top/tags/%E7%AE%97%E6%B3%95%E7%AC%94%E8%AE%B0/ Recent content in 算法笔记 on pluvium27 Hugo zh © pluvium27 Wed, 28 Aug 2024 21:19:09 +0800 https://pluv27.top/posts/2024/dijkstra-%E5%92%8C-floyd-%E7%AE%97%E6%B3%95%E7%9A%84%E7%A4%BA%E4%BE%8B-c-%E5%AE%9E%E7%8E%B0/ Wed, 28 Aug 2024 21:19:09 +0800 https://pluv27.top/posts/2024/dijkstra-%E5%92%8C-floyd-%E7%AE%97%E6%B3%95%E7%9A%84%E7%A4%BA%E4%BE%8B-c-%E5%AE%9E%E7%8E%B0/ <p>如题, 有 Dijkstra 和 Floyd 算法</p> https://pluv27.top/posts/2023/%E8%B4%AA%E5%BF%83%E7%AE%97%E6%B3%95%E5%85%A5%E9%97%A8/ Sat, 15 Jul 2023 19:02:14 +0800 https://pluv27.top/posts/2023/%E8%B4%AA%E5%BF%83%E7%AE%97%E6%B3%95%E5%85%A5%E9%97%A8/ <p>贪心算法的核心思想是通过局部最优解得到或近似取得全局最优解, 此时有几个待解决的问题:</p> <ol> <li>怎么判断题目是否应用贪心策略求解?</li> <li>怎么寻求局部最优与全局最优的关系?</li> <li>如何选择最优的贪心标准以得到全局最优/较优解?</li> </ol>