<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Interactive on</title><link>https://h30306.github.io/blog/zh-tw/tags/interactive/</link><description>Recent content in Interactive on</description><generator>Hugo -- gohugo.io</generator><language>zh-tw</language><managingEditor>hwork0511@gmail.com (Wei Yi Chung)</managingEditor><webMaster>hwork0511@gmail.com (Wei Yi Chung)</webMaster><copyright>© 2026 Wei Yi Chung</copyright><lastBuildDate>Tue, 23 Aug 2022 00:00:00 +0000</lastBuildDate><atom:link href="https://h30306.github.io/blog/zh-tw/tags/interactive/index.xml" rel="self" type="application/rss+xml"/><item><title>LeetCode 278: First Bad Version</title><link>https://h30306.github.io/blog/zh-tw/leetcode/leetcode-278/</link><pubDate>Tue, 23 Aug 2022 00:00:00 +0000</pubDate><author>hwork0511@gmail.com (Wei Yi Chung)</author><guid>https://h30306.github.io/blog/zh-tw/leetcode/leetcode-278/</guid><description>LeetCode 278 解題筆記：找第一個 isBadVersion 為 True 的版本，lower bound 二分；呼叫 API 的次數是 O(log n)</description><media:content xmlns:media="http://search.yahoo.com/mrss/" url="https://h30306.github.io/blog/leetcode/leetcode-278/featured.png"/></item><item><title>LeetCode 374: Guess Number Higher or Lower</title><link>https://h30306.github.io/blog/zh-tw/leetcode/leetcode-374/</link><pubDate>Tue, 23 Aug 2022 00:00:00 +0000</pubDate><author>hwork0511@gmail.com (Wei Yi Chung)</author><guid>https://h30306.github.io/blog/zh-tw/leetcode/leetcode-374/</guid><description>LeetCode 374 解題筆記：依 guess 的回傳值調整範圍；-1 代表猜太大，1 代表猜太小</description><media:content xmlns:media="http://search.yahoo.com/mrss/" url="https://h30306.github.io/blog/leetcode/leetcode-374/featured.png"/></item></channel></rss>