Site updated: 2020-02-06 19:53:56

Author: liyuechao

algorithm/leetcode-1-Two-Sum.html

@@ -38,7 +38,7 @@ <h1 id="best-method"><a href="#best-method" class="headerlink" title="best metho
             enableHotKey: true,
             isLocked: false
         })
-        gitalk.render('comment-container')</script></div></div></div><div class="column column-left is-4-tablet is-4-desktop is-4-widescreen  order-1 is-sticky"><div class="card widget toc-scroll" id="toc"><div class="card-content"><div class="menu"><h3 class="menu-label">目录</h3><ul class="menu-list"><li><a class="is-flex" id="toc-item-description" href="#description"><span>description</span></a></li><li><a class="is-flex" id="toc-item-common-method" href="#common-method"><span>common method</span></a></li><li><a class="is-flex" id="toc-item-best-method" href="#best-method"><span>best method</span></a></li></ul></div></div><script type="text/javascript">
+        gitalk.render('comment-container')</script></div></div></div><div class="column column-left is-4-tablet is-4-desktop is-4-widescreen  order-1 is-sticky"><div class="card widget toc-scroll" id="toc"><div class="card-content"><div class="menu"><h3 class="menu-label">目录</h3><ul class="menu-list"><li><a class="is-flex" id="toc-item-description" href="#description"><span>description</span></a></li><li><a class="is-flex" id="toc-item-common-method" href="#common-method"><span>common method</span></a></li><li><a class="is-flex" id="toc-item-best-method" href="#best-method"><span>best method</span></a></li></ul></div></div><script src="https://cdnjs.cloudflare.com/ajax/libs/jquery/2.1.4/jquery.min.js"></script><script type="text/javascript" async>
         $(document).ready(function () { //参考自 https://github.com/ppoffice/hexo-theme-icarus/pull/616/files
             var observerTopMargin;
             var scrollObserver;

algorithm/leetcode-2-Add-Two-Numbers.html

@@ -36,7 +36,7 @@ <h2 id="best"><a href="#best" class="headerlink" title="best"></a>best</h2><figu
             enableHotKey: true,
             isLocked: false
         })
-        gitalk.render('comment-container')</script></div></div></div><div class="column column-left is-4-tablet is-4-desktop is-4-widescreen  order-1 is-sticky"><div class="card widget toc-scroll" id="toc"><div class="card-content"><div class="menu"><h3 class="menu-label">目录</h3><ul class="menu-list"><li><a class="is-flex" id="toc-item-Add-Two-Numbers" href="#Add-Two-Numbers"><span>Add Two Numbers</span></a><ul class="menu-list"><li><a class="is-flex" id="toc-item-common" href="#common"><span>common</span></a></li><li><a class="is-flex" id="toc-item-best" href="#best"><span>best</span></a></li></ul></li></ul></div></div><script type="text/javascript">
+        gitalk.render('comment-container')</script></div></div></div><div class="column column-left is-4-tablet is-4-desktop is-4-widescreen  order-1 is-sticky"><div class="card widget toc-scroll" id="toc"><div class="card-content"><div class="menu"><h3 class="menu-label">目录</h3><ul class="menu-list"><li><a class="is-flex" id="toc-item-Add-Two-Numbers" href="#Add-Two-Numbers"><span>Add Two Numbers</span></a><ul class="menu-list"><li><a class="is-flex" id="toc-item-common" href="#common"><span>common</span></a></li><li><a class="is-flex" id="toc-item-best" href="#best"><span>best</span></a></li></ul></li></ul></div></div><script src="https://cdnjs.cloudflare.com/ajax/libs/jquery/2.1.4/jquery.min.js"></script><script type="text/javascript" async>
         $(document).ready(function () { //参考自 https://github.com/ppoffice/hexo-theme-icarus/pull/616/files
             var observerTopMargin;
             var scrollObserver;

algorithm/二分查找法模板的基本思想-leetcode35.html

@@ -168,7 +168,7 @@ <h3 id="总结"><a href="#总结" class="headerlink" title="总结"></a>总结</
             enableHotKey: true,
             isLocked: false
         })
-        gitalk.render('comment-container')</script></div></div></div><div class="column column-left is-4-tablet is-4-desktop is-4-widescreen  order-1 is-sticky"><div class="card widget toc-scroll" id="toc"><div class="card-content"><div class="menu"><h3 class="menu-label">目录</h3><ul class="menu-list"><li><a class="is-flex" id="toc-item-leetcode35" href="#leetcode35"><span>leetcode35</span></a></li><li><a class="is-flex" id="toc-item-二分查找法模板的基本思想" href="#二分查找法模板的基本思想"><span>二分查找法模板的基本思想</span></a></li><li><a class="is-flex" id="toc-item-细节、注意事项、调试方法" href="#细节、注意事项、调试方法"><span>细节、注意事项、调试方法</span></a></li><li><a class="is-flex" id="toc-item-总结" href="#总结"><span>总结</span></a></li></ul></div></div><script type="text/javascript">
+        gitalk.render('comment-container')</script></div></div></div><div class="column column-left is-4-tablet is-4-desktop is-4-widescreen  order-1 is-sticky"><div class="card widget toc-scroll" id="toc"><div class="card-content"><div class="menu"><h3 class="menu-label">目录</h3><ul class="menu-list"><li><a class="is-flex" id="toc-item-leetcode35" href="#leetcode35"><span>leetcode35</span></a></li><li><a class="is-flex" id="toc-item-二分查找法模板的基本思想" href="#二分查找法模板的基本思想"><span>二分查找法模板的基本思想</span></a></li><li><a class="is-flex" id="toc-item-细节、注意事项、调试方法" href="#细节、注意事项、调试方法"><span>细节、注意事项、调试方法</span></a></li><li><a class="is-flex" id="toc-item-总结" href="#总结"><span>总结</span></a></li></ul></div></div><script src="https://cdnjs.cloudflare.com/ajax/libs/jquery/2.1.4/jquery.min.js"></script><script type="text/javascript" async>
         $(document).ready(function () { //参考自 https://github.com/ppoffice/hexo-theme-icarus/pull/616/files
             var observerTopMargin;
             var scrollObserver;

algorithm/动态规划DP算法详解.html

@@ -142,7 +142,7 @@ <h3 id="总结"><a href="#总结" class="headerlink" title="总结"></a>总结</
             enableHotKey: true,
             isLocked: false
         })
-        gitalk.render('comment-container')</script></div></div></div><div class="column column-left is-4-tablet is-4-desktop is-4-widescreen  order-1 is-sticky"><div class="card widget toc-scroll" id="toc"><div class="card-content"><div class="menu"><h3 class="menu-label">目录</h3><ul class="menu-list"><li><a class="is-flex" id="toc-item-定义" href="#定义"><span>定义</span></a><ul class="menu-list"><li><a class="is-flex" id="toc-item-最优子结构" href="#最优子结构"><span>最优子结构</span></a></li><li><a class="is-flex" id="toc-item-如何发掘最优子结构的性质？" href="#如何发掘最优子结构的性质？"><span>如何发掘最优子结构的性质？</span></a></li><li><a class="is-flex" id="toc-item-刻画子问题空间的经验" href="#刻画子问题空间的经验"><span>刻画子问题空间的经验</span></a></li><li><a class="is-flex" id="toc-item-对于不同问题领域，最优子结构的不同体现在两个方面：" href="#对于不同问题领域，最优子结构的不同体现在两个方面："><span>对于不同问题领域，最优子结构的不同体现在两个方面：</span></a></li><li><a class="is-flex" id="toc-item-重叠子问题" href="#重叠子问题"><span>重叠子问题</span></a></li><li><a class="is-flex" id="toc-item-核心问题" href="#核心问题"><span>核心问题</span></a></li></ul></li><li><a class="is-flex" id="toc-item-状态转移方程" href="#状态转移方程"><span>状态转移方程</span></a><ul class="menu-list"><li><a class="is-flex" id="toc-item-各种模型的状态转移方程汇总如下：" href="#各种模型的状态转移方程汇总如下："><span>各种模型的状态转移方程汇总如下：</span></a><ul class="menu-list"><li><a class="is-flex" id="toc-item-1、最长公共子串" href="#1、最长公共子串"><span>1、最长公共子串</span></a></li><li><a class="is-flex" id="toc-item-2、最长公共子序列" href="#2、最长公共子序列"><span>2、最长公共子序列</span></a></li><li><a class="is-flex" id="toc-item-3、最长递增子序列（最长递减子序列）" href="#3、最长递增子序列（最长递减子序列）"><span>3、最长递增子序列（最长递减子序列）</span></a></li><li><a class="is-flex" id="toc-item-4、最大子序列和的问题" href="#4、最大子序列和的问题"><span>4、最大子序列和的问题</span></a></li><li><a class="is-flex" id="toc-item-5、数塔问题（动态搜索）" href="#5、数塔问题（动态搜索）"><span>5、数塔问题（动态搜索）</span></a></li><li><a class="is-flex" id="toc-item-6、（01）背包问题" href="#6、（01）背包问题"><span>6、（01）背包问题</span></a></li><li><a class="is-flex" id="toc-item-7、矩阵连乘（矩阵链问题）-参考《算法导论》" href="#7、矩阵连乘（矩阵链问题）-参考《算法导论》"><span>7、矩阵连乘（矩阵链问题）-参考《算法导论》</span></a></li></ul></li></ul></li><li><a class="is-flex" id="toc-item-总结" href="#总结"><span>总结</span></a></li></ul></div></div><script type="text/javascript">
+        gitalk.render('comment-container')</script></div></div></div><div class="column column-left is-4-tablet is-4-desktop is-4-widescreen  order-1 is-sticky"><div class="card widget toc-scroll" id="toc"><div class="card-content"><div class="menu"><h3 class="menu-label">目录</h3><ul class="menu-list"><li><a class="is-flex" id="toc-item-定义" href="#定义"><span>定义</span></a><ul class="menu-list"><li><a class="is-flex" id="toc-item-最优子结构" href="#最优子结构"><span>最优子结构</span></a></li><li><a class="is-flex" id="toc-item-如何发掘最优子结构的性质？" href="#如何发掘最优子结构的性质？"><span>如何发掘最优子结构的性质？</span></a></li><li><a class="is-flex" id="toc-item-刻画子问题空间的经验" href="#刻画子问题空间的经验"><span>刻画子问题空间的经验</span></a></li><li><a class="is-flex" id="toc-item-对于不同问题领域，最优子结构的不同体现在两个方面：" href="#对于不同问题领域，最优子结构的不同体现在两个方面："><span>对于不同问题领域，最优子结构的不同体现在两个方面：</span></a></li><li><a class="is-flex" id="toc-item-重叠子问题" href="#重叠子问题"><span>重叠子问题</span></a></li><li><a class="is-flex" id="toc-item-核心问题" href="#核心问题"><span>核心问题</span></a></li></ul></li><li><a class="is-flex" id="toc-item-状态转移方程" href="#状态转移方程"><span>状态转移方程</span></a><ul class="menu-list"><li><a class="is-flex" id="toc-item-各种模型的状态转移方程汇总如下：" href="#各种模型的状态转移方程汇总如下："><span>各种模型的状态转移方程汇总如下：</span></a><ul class="menu-list"><li><a class="is-flex" id="toc-item-1、最长公共子串" href="#1、最长公共子串"><span>1、最长公共子串</span></a></li><li><a class="is-flex" id="toc-item-2、最长公共子序列" href="#2、最长公共子序列"><span>2、最长公共子序列</span></a></li><li><a class="is-flex" id="toc-item-3、最长递增子序列（最长递减子序列）" href="#3、最长递增子序列（最长递减子序列）"><span>3、最长递增子序列（最长递减子序列）</span></a></li><li><a class="is-flex" id="toc-item-4、最大子序列和的问题" href="#4、最大子序列和的问题"><span>4、最大子序列和的问题</span></a></li><li><a class="is-flex" id="toc-item-5、数塔问题（动态搜索）" href="#5、数塔问题（动态搜索）"><span>5、数塔问题（动态搜索）</span></a></li><li><a class="is-flex" id="toc-item-6、（01）背包问题" href="#6、（01）背包问题"><span>6、（01）背包问题</span></a></li><li><a class="is-flex" id="toc-item-7、矩阵连乘（矩阵链问题）-参考《算法导论》" href="#7、矩阵连乘（矩阵链问题）-参考《算法导论》"><span>7、矩阵连乘（矩阵链问题）-参考《算法导论》</span></a></li></ul></li></ul></li><li><a class="is-flex" id="toc-item-总结" href="#总结"><span>总结</span></a></li></ul></div></div><script src="https://cdnjs.cloudflare.com/ajax/libs/jquery/2.1.4/jquery.min.js"></script><script type="text/javascript" async>
         $(document).ready(function () { //参考自 https://github.com/ppoffice/hexo-theme-icarus/pull/616/files
             var observerTopMargin;
             var scrollObserver;

algorithm/算法成长之路leetcode1-4.html

@@ -88,7 +88,7 @@ <h4 id="eg3"><a href="#eg3" class="headerlink" title="eg3."></a>eg3.</h4><figure
             enableHotKey: true,
             isLocked: false
         })
-        gitalk.render('comment-container')</script></div></div></div><div class="column column-left is-4-tablet is-4-desktop is-4-widescreen  order-1 is-sticky"><div class="card widget toc-scroll" id="toc"><div class="card-content"><div class="menu"><h3 class="menu-label">目录</h3><ul class="menu-list"><li><a class="is-flex" id="toc-item-1-Two-Sum" href="#1-Two-Sum"><span>1.Two Sum</span></a><ul class="menu-list"><li><a class="is-flex" id="toc-item-desc" href="#desc"><span>desc</span></a></li><li><a class="is-flex" id="toc-item-solution" href="#solution"><span>solution</span></a><ul class="menu-list"><li><a class="is-flex" id="toc-item-s-eg1" href="#s-eg1"><span>s.eg1.</span></a></li><li><a class="is-flex" id="toc-item-eg2" href="#eg2"><span>eg2.</span></a></li></ul></li></ul></li><li><a class="is-flex" id="toc-item-2-Add-Two-Numbers" href="#2-Add-Two-Numbers"><span>2.Add Two Numbers</span></a><ul class="menu-list"><li><a class="is-flex" id="toc-item-des" href="#des"><span>des</span></a></li><li><a class="is-flex" id="toc-item-solution-1" href="#solution-1"><span>solution</span></a><ul class="menu-list"><li><a class="is-flex" id="toc-item-eg1" href="#eg1"><span>eg1.</span></a></li></ul></li></ul></li><li><a class="is-flex" id="toc-item-3-Longest-Substring-Without-Repeating-Characters" href="#3-Longest-Substring-Without-Repeating-Characters"><span>3.Longest Substring Without Repeating Characters</span></a><ul class="menu-list"><li><a class="is-flex" id="toc-item-desc-1" href="#desc-1"><span>desc</span></a></li><li><a class="is-flex" id="toc-item-solution-2" href="#solution-2"><span>solution</span></a><ul class="menu-list"><li><a class="is-flex" id="toc-item-eg1-1" href="#eg1-1"><span>eg1.</span></a></li><li><a class="is-flex" id="toc-item-eg2-1" href="#eg2-1"><span>eg2.</span></a></li></ul></li></ul></li><li><a class="is-flex" id="toc-item-4-Median-of-Two-Sorted-Arrays" href="#4-Median-of-Two-Sorted-Arrays"><span>4.Median of Two Sorted Arrays</span></a><ul class="menu-list"><li><a class="is-flex" id="toc-item-desc-2" href="#desc-2"><span>desc</span></a></li><li><a class="is-flex" id="toc-item-solution-3" href="#solution-3"><span>solution</span></a><ul class="menu-list"><li><a class="is-flex" id="toc-item-eg1-2" href="#eg1-2"><span>eg1.</span></a></li><li><a class="is-flex" id="toc-item-eg2-2" href="#eg2-2"><span>eg2.</span></a></li><li><a class="is-flex" id="toc-item-eg3" href="#eg3"><span>eg3.</span></a></li></ul></li></ul></li></ul></div></div><script type="text/javascript">
+        gitalk.render('comment-container')</script></div></div></div><div class="column column-left is-4-tablet is-4-desktop is-4-widescreen  order-1 is-sticky"><div class="card widget toc-scroll" id="toc"><div class="card-content"><div class="menu"><h3 class="menu-label">目录</h3><ul class="menu-list"><li><a class="is-flex" id="toc-item-1-Two-Sum" href="#1-Two-Sum"><span>1.Two Sum</span></a><ul class="menu-list"><li><a class="is-flex" id="toc-item-desc" href="#desc"><span>desc</span></a></li><li><a class="is-flex" id="toc-item-solution" href="#solution"><span>solution</span></a><ul class="menu-list"><li><a class="is-flex" id="toc-item-s-eg1" href="#s-eg1"><span>s.eg1.</span></a></li><li><a class="is-flex" id="toc-item-eg2" href="#eg2"><span>eg2.</span></a></li></ul></li></ul></li><li><a class="is-flex" id="toc-item-2-Add-Two-Numbers" href="#2-Add-Two-Numbers"><span>2.Add Two Numbers</span></a><ul class="menu-list"><li><a class="is-flex" id="toc-item-des" href="#des"><span>des</span></a></li><li><a class="is-flex" id="toc-item-solution-1" href="#solution-1"><span>solution</span></a><ul class="menu-list"><li><a class="is-flex" id="toc-item-eg1" href="#eg1"><span>eg1.</span></a></li></ul></li></ul></li><li><a class="is-flex" id="toc-item-3-Longest-Substring-Without-Repeating-Characters" href="#3-Longest-Substring-Without-Repeating-Characters"><span>3.Longest Substring Without Repeating Characters</span></a><ul class="menu-list"><li><a class="is-flex" id="toc-item-desc-1" href="#desc-1"><span>desc</span></a></li><li><a class="is-flex" id="toc-item-solution-2" href="#solution-2"><span>solution</span></a><ul class="menu-list"><li><a class="is-flex" id="toc-item-eg1-1" href="#eg1-1"><span>eg1.</span></a></li><li><a class="is-flex" id="toc-item-eg2-1" href="#eg2-1"><span>eg2.</span></a></li></ul></li></ul></li><li><a class="is-flex" id="toc-item-4-Median-of-Two-Sorted-Arrays" href="#4-Median-of-Two-Sorted-Arrays"><span>4.Median of Two Sorted Arrays</span></a><ul class="menu-list"><li><a class="is-flex" id="toc-item-desc-2" href="#desc-2"><span>desc</span></a></li><li><a class="is-flex" id="toc-item-solution-3" href="#solution-3"><span>solution</span></a><ul class="menu-list"><li><a class="is-flex" id="toc-item-eg1-2" href="#eg1-2"><span>eg1.</span></a></li><li><a class="is-flex" id="toc-item-eg2-2" href="#eg2-2"><span>eg2.</span></a></li><li><a class="is-flex" id="toc-item-eg3" href="#eg3"><span>eg3.</span></a></li></ul></li></ul></li></ul></div></div><script src="https://cdnjs.cloudflare.com/ajax/libs/jquery/2.1.4/jquery.min.js"></script><script type="text/javascript" async>
         $(document).ready(function () { //参考自 https://github.com/ppoffice/hexo-theme-icarus/pull/616/files
             var observerTopMargin;
             var scrollObserver;