Tree-Diameter onhttps://h30306.github.io/blog/zh-tw/tags/tree-diameter/Recent content in Tree-Diameter onHugo -- gohugo.iozh-twhwork0511@gmail.com (Wei Yi Chung)hwork0511@gmail.com (Wei Yi Chung)© 2026 Wei Yi ChungThu, 15 Oct 2026 00:00:00 +0000LeetCode 3203: Find Minimum Diameter After Merging Two Treeshttps://h30306.github.io/blog/zh-tw/leetcode/leetcode-3203/Thu, 15 Oct 2026 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/zh-tw/leetcode/leetcode-3203/LeetCode 3203 解題筆記：連接兩棵樹的中心，答案是 max(d1, d2, ceil(d1/2) + ceil(d2/2) + 1)LeetCode 3313: Find the Last Marked Nodes in Treehttps://h30306.github.io/blog/zh-tw/leetcode/leetcode-3313/Thu, 17 Sep 2026 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/zh-tw/leetcode/leetcode-3313/LeetCode 3313 解題筆記：最後被標記的就是最遠的點，而最遠點一定能取直徑端點