22<rss version =" 2.0" xmlns : atom =" http://www.w3.org/2005/Atom" >
33 <channel >
44 <title >Algorithm on pipo' s site</title >
5- <link >https://texify3.michaelneuper.com /categories/algorithm/</link >
5+ <link >https://asgpipo.github.io /categories/algorithm/</link >
66 <description >Recent content in Algorithm on pipo' s site</description >
77 <generator >Hugo -- gohugo.io</generator >
88 <language >en</language >
9- <lastBuildDate >Sun, 24 Nov 2024 00:00:00 +0000</lastBuildDate ><atom : link href =" https://texify3.michaelneuper.com /categories/algorithm/index.xml" rel =" self" type =" application/rss+xml" />
9+ <lastBuildDate >Sun, 24 Nov 2024 00:00:00 +0000</lastBuildDate ><atom : link href =" https://asgpipo.github.io /categories/algorithm/index.xml" rel =" self" type =" application/rss+xml" />
1010 <item >
1111 <title >0-1 Package</title >
12- <link >https://texify3.michaelneuper.com /posts/prob/dp-01%E8%83%8C%E5%8C%85/</link >
12+ <link >https://asgpipo.github.io /posts/prob/dp-01%E8%83%8C%E5%8C%85/</link >
1313 <pubDate >Sun, 24 Nov 2024 00:00:00 +0000</pubDate >
1414
15- <guid >https://texify3.michaelneuper.com /posts/prob/dp-01%E8%83%8C%E5%8C%85/</guid >
15+ <guid >https://asgpipo.github.io /posts/prob/dp-01%E8%83%8C%E5%8C%85/</guid >
1616 <description >< h1 id=" 例题讲解"> 例题讲解< /h1>
1717< h2 id=" 基础的零一背包"> 基础的零一背包< /h2>
1818< p> 给定 背包容量和两个数组.两数组分别代表各物品的价值和体积.< /p>
@@ -497,10 +497,10 @@ if a1-b1 &gt; 0
497497
498498 <item >
499499 <title >BinaryTree 迭代层序遍历 </title >
500- <link >https://texify3.michaelneuper.com /posts/prob/%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E8%BF%AD%E4%BB%A3%E5%89%8D%E4%B8%AD%E5%90%8E%E9%81%8D%E5%8E%86/</link >
500+ <link >https://asgpipo.github.io /posts/prob/%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E8%BF%AD%E4%BB%A3%E5%89%8D%E4%B8%AD%E5%90%8E%E9%81%8D%E5%8E%86/</link >
501501 <pubDate >Sat, 05 Oct 2024 00:00:00 +0000</pubDate >
502502
503- <guid >https://texify3.michaelneuper.com /posts/prob/%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E8%BF%AD%E4%BB%A3%E5%89%8D%E4%B8%AD%E5%90%8E%E9%81%8D%E5%8E%86/</guid >
503+ <guid >https://asgpipo.github.io /posts/prob/%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E8%BF%AD%E4%BB%A3%E5%89%8D%E4%B8%AD%E5%90%8E%E9%81%8D%E5%8E%86/</guid >
504504 <description >< h1 id=" 二叉树的迭代遍历法基于栈实现"> 二叉树的迭代遍历法(基于栈实现)< /h1>
505505< blockquote>
506506< p> 题目链接< /p>
@@ -517,19 +517,19 @@ if a1-b1 &gt; 0
517517< table>
518518 < thead>
519519 < tr>
520- < th>< img src=" https://texify3.michaelneuper.com /pics/binarytree_stack1.png" alt="">< /th>
521- < th>< img src=" https://texify3.michaelneuper.com /pics/binarytree_stack3.png" alt="">< /th>
522- < th>< img src=" https://texify3.michaelneuper.com /pics/binarytree_stack3.png" alt="">< /th>
520+ < th>< img src=" https://asgpipo.github.io /pics/binarytree_stack1.png" alt="">< /th>
521+ < th>< img src=" https://asgpipo.github.io /pics/binarytree_stack3.png" alt="">< /th>
522+ < th>< img src=" https://asgpipo.github.io /pics/binarytree_stack3.png" alt="">< /th>
523523 < /tr>
524524 < /thead>
525525 < tbody>
526526 < tr>
527- < td>< img src=" https://texify3.michaelneuper.com /pics/binarytree_stack4.png" alt="">< /td>
528- < td>< img src=" https://texify3.michaelneuper.com /pics/binarytree_stack5.png" alt="">< /td>
529- < td>< img src=" https://texify3.michaelneuper.com /pics/binarytree_stack6.png" alt="">< /td>
527+ < td>< img src=" https://asgpipo.github.io /pics/binarytree_stack4.png" alt="">< /td>
528+ < td>< img src=" https://asgpipo.github.io /pics/binarytree_stack5.png" alt="">< /td>
529+ < td>< img src=" https://asgpipo.github.io /pics/binarytree_stack6.png" alt="">< /td>
530530 < /tr>
531531 < tr>
532- < td>< img src=" https://texify3.michaelneuper.com /pics/binarytree_stack7.png" alt="">< /td>
532+ < td>< img src=" https://asgpipo.github.io /pics/binarytree_stack7.png" alt="">< /td>
533533 < td>< /td>
534534 < td>< /td>
535535 < /tr>
@@ -559,7 +559,7 @@ if a1-b1 &gt; 0
559559< /span>< /span>< /code>< /pre>< /div>< p> 前序遍历的迭代方式是最简单理解的,其他中序后序难度相较其稍高,需要多理解找出相似点与不同点。< /p>
560560< h2 id=" 中序遍历法"> 中序遍历法< /h2>
561561< p> 我们知道前序遍历会沿着左侧方向不断遍历直到为空,此时回到父节点,然后再进入右子树,向左不断遍历,如图所示。< /p>
562- < p>< img src=" https://texify3.michaelneuper.com /pics/binarytree_inorderpng.png" alt="">< /p>
562+ < p>< img src=" https://asgpipo.github.io /pics/binarytree_inorderpng.png" alt="">< /p>
563563< p> 我们可以根据这个图来写基本的框架< /p>
564564< div class=" highlight">< pre tabindex=" 0" class=" chroma">< code class=" language-fallback" data-lang=" fallback">< span class=" line">< span class=" cl"> while !root or !st.empty()
565565< /span>< /span>< span class=" line">< span class=" cl"> while root is not Null
@@ -701,15 +701,15 @@ if a1-b1 &gt; 0
701701
702702 <item >
703703 <title >BinaryTree 层序遍历 LC.102</title >
704- <link >https://texify3.michaelneuper.com /posts/prob/lc102.%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E5%B1%82%E5%BA%8F%E9%81%8D%E5%8E%86/</link >
704+ <link >https://asgpipo.github.io /posts/prob/lc102.%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E5%B1%82%E5%BA%8F%E9%81%8D%E5%8E%86/</link >
705705 <pubDate >Wed, 02 Oct 2024 00:00:00 +0000</pubDate >
706706
707- <guid >https://texify3.michaelneuper.com /posts/prob/lc102.%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E5%B1%82%E5%BA%8F%E9%81%8D%E5%8E%86/</guid >
707+ <guid >https://asgpipo.github.io /posts/prob/lc102.%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E5%B1%82%E5%BA%8F%E9%81%8D%E5%8E%86/</guid >
708708 <description >< h1 id=" 102-二叉树的层序遍历"> 102. 二叉树的层序遍历< /h1>
709709< p> 题目地址:< a href=" https://leetcode.cn/problems/binary-tree-level-order-traversal/"> 102. 二叉树的层序遍历< /a>< /p>
710710< p> 给你二叉树的根节点 < code> root< /code> ,返回其节点值的 < strong> 层序遍历< /strong> 。 (即逐层地,从左到右访问所有节点)。< /p>
711711< p>< strong> 示例 1:< /strong>< /p>
712- < p>< img src=" https://texify3.michaelneuper.com /pics/tree1.jpg" alt=" img">< /p>
712+ < p>< img src=" https://asgpipo.github.io /pics/tree1.jpg" alt=" img">< /p>
713713< div class=" highlight">< pre tabindex=" 0" class=" chroma">< code class=" language-fallback" data-lang=" fallback">< span class=" line">< span class=" cl"> 输入:root = [3,9,20,null,null,15,7]
714714< /span>< /span>< span class=" line">< span class=" cl"> 输出:[[3],[9,20],[15,7]]
715715< /span>< /span>< /code>< /pre>< /div>< p>< strong> 示例 2:< /strong>< /p>
@@ -789,15 +789,15 @@ if a1-b1 &gt; 0
789789< table>
790790 < thead>
791791 < tr>
792- < th>< img src=" https://texify3.michaelneuper.com /pics/queue_tree1.png" alt=" queue_tree3">< /th>
793- < th>< img src=" https://texify3.michaelneuper.com /pics/queue_tree2.png" alt=" queue_tree3">< /th>
794- < th>< img src=" https://texify3.michaelneuper.com /pics/queue_tree3.png" alt=" queue_tree3">< /th>
792+ < th>< img src=" https://asgpipo.github.io /pics/queue_tree1.png" alt=" queue_tree3">< /th>
793+ < th>< img src=" https://asgpipo.github.io /pics/queue_tree2.png" alt=" queue_tree3">< /th>
794+ < th>< img src=" https://asgpipo.github.io /pics/queue_tree3.png" alt=" queue_tree3">< /th>
795795 < /tr>
796796 < /thead>
797797 < tbody>
798798 < tr>
799- < td>< img src=" https://texify3.michaelneuper.com /pics/queue_tree4.png" alt=" queue_tree3">< /td>
800- < td>< img src=" https://texify3.michaelneuper.com /pics/queue_tree5.png" alt=" queue_tree3">< /td>
799+ < td>< img src=" https://asgpipo.github.io /pics/queue_tree4.png" alt=" queue_tree3">< /td>
800+ < td>< img src=" https://asgpipo.github.io /pics/queue_tree5.png" alt=" queue_tree3">< /td>
801801 < td>< /td>
802802 < /tr>
803803 < /tbody>
0 commit comments