<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"><channel><title>debug.log — 普通人類的觀察日記</title><description>機器人研究筆記、資安 CTF writeup、強化學習實作，以及偶爾出現的日文學習心得。</description><link>https://alifestone.github.io/</link><language>zh-TW</language><item><title>Hello, debug.log — 第一篇文章與 Markdown 範本</title><link>https://alifestone.github.io/posts/hello-world/</link><guid isPermaLink="true">https://alifestone.github.io/posts/hello-world/</guid><description>部落格開站的第一篇，順便當作 Markdown 撰寫範本——示範標題、清單、引言、程式碼、表格與圖片怎麼寫。</description><pubDate>Sun, 12 Jul 2026 00:00:00 GMT</pubDate><category>機器人</category><category>meta</category><category>markdown</category><category>範本</category></item><item><title>LeetCode -- 1970. Last Day Where You Can Still Cross</title><link>https://alifestone.github.io/posts/leetcode-1970-last-day-where-you-can-still-cross/</link><guid isPermaLink="true">https://alifestone.github.io/posts/leetcode-1970-last-day-where-you-can-still-cross/</guid><description>用二分搜尋天數搭配 BFS 檢查連通性，找出最後一天還能從第一列走到最後一列。順帶談 set、tuple hashable 與遞迴 MLE 的細節。</description><pubDate>Fri, 02 Jan 2026 00:00:00 GMT</pubDate><category>演算法</category><category>LeetCode</category><category>二分搜</category><category>BFS</category><category>Python</category></item><item><title>LeetCode -- 1504. Count Submatrices With All Ones</title><link>https://alifestone.github.io/posts/leetcode-1504-count-submatrices-with-all-ones/</link><guid isPermaLink="true">https://alifestone.github.io/posts/leetcode-1504-count-submatrices-with-all-ones/</guid><description>計數全為 1 的子矩陣。分享三種方法——座標化（會 TLE）、枚舉、單調堆疊，並解釋 prev + (i - j) * h 這條關鍵公式。</description><pubDate>Mon, 01 Sep 2025 00:00:00 GMT</pubDate><category>演算法</category><category>LeetCode</category><category>單調堆疊</category><category>枚舉</category><category>Python</category></item><item><title>LeetCode -- 2. Add Two Numbers</title><link>https://alifestone.github.io/posts/leetcode-2-add-two-numbers/</link><guid isPermaLink="true">https://alifestone.github.io/posts/leetcode-2-add-two-numbers/</guid><description>兩個逆序儲存的鏈結串列相加。用 dummy head 搭配 carry 變數逐位相加，是練習 linked list 指標操作的經典題。</description><pubDate>Tue, 19 Aug 2025 00:00:00 GMT</pubDate><category>演算法</category><category>LeetCode</category><category>Linked List</category><category>Python</category></item><item><title>Link list in python</title><link>https://alifestone.github.io/posts/link-list-in-python/</link><guid isPermaLink="true">https://alifestone.github.io/posts/link-list-in-python/</guid><description>為了解 LeetCode 2. Add Two Numbers 而整理的 Python 鏈結串列教學。八個核心概念，每個概念都搭配一段可以直接執行的程式碼。</description><pubDate>Tue, 19 Aug 2025 00:00:00 GMT</pubDate><category>演算法</category><category>Linked List</category><category>Python</category><category>資料結構</category><category>教學</category></item><item><title>LeetCode -- 808. Soup Servings</title><link>https://alifestone.github.io/posts/leetcode-808-soup-servings/</link><guid isPermaLink="true">https://alifestone.github.io/posts/leetcode-808-soup-servings/</guid><description>兩碗湯的機率題。用 lru_cache 避免重複計算、把 25 毫升記為 1 縮小狀態空間，再利用誤差容忍度在 n 很大時直接回傳 1。</description><pubDate>Fri, 15 Aug 2025 00:00:00 GMT</pubDate><category>演算法</category><category>LeetCode</category><category>遞迴</category><category>快取</category><category>機率</category><category>Python</category></item><item><title>2025 CTF 資安種子培訓交流會</title><link>https://alifestone.github.io/posts/2025-ctf-security-seed-training/</link><guid isPermaLink="true">https://alifestone.github.io/posts/2025-ctf-security-seed-training/</guid><description>交流會筆記。nini 的資源分享、與王銘宏副教授等講者的沙龍問答，以及 splitline 談解題分工與比賽心態。</description><pubDate>Sat, 09 Aug 2025 00:00:00 GMT</pubDate><category>資安 CTF</category><category>CTF</category><category>心得</category><category>資安</category></item><item><title>Leetcode -- 904. Fruit Into Baskets</title><link>https://alifestone.github.io/posts/leetcode-904-fruit-into-baskets/</link><guid isPermaLink="true">https://alifestone.github.io/posts/leetcode-904-fruit-into-baskets/</guid><description>滑動視窗的經典題。兩種解法——一種用 defaultdict 記錄水果種類，另一種只用兩個變數，快了 174 ms。</description><pubDate>Wed, 06 Aug 2025 00:00:00 GMT</pubDate><category>演算法</category><category>LeetCode</category><category>sliding window</category><category>Python</category></item><item><title>Leetcode - Pascal&apos;s Triangle</title><link>https://alifestone.github.io/posts/leetcode-pascals-triangle/</link><guid isPermaLink="true">https://alifestone.github.io/posts/leetcode-pascals-triangle/</guid><description>用遞迴走訪帕斯卡三角的每一層、迴圈生成每層元素，並處理 numRows 為 1 和 2 的例外。</description><pubDate>Fri, 01 Aug 2025 00:00:00 GMT</pubDate><category>演算法</category><category>LeetCode</category><category>遞迴</category><category>Python</category></item><item><title>Leetcode -- Two Sum</title><link>https://alifestone.github.io/posts/leetcode-two-sum/</link><guid isPermaLink="true">https://alifestone.github.io/posts/leetcode-two-sum/</guid><description>從 O(n²) 的雙迴圈一路優化到單次走訪的 hashmap 解法，看 Python dictionary 的 hashtable 特性如何把查找降到接近 O(1)。</description><pubDate>Wed, 30 Jul 2025 00:00:00 GMT</pubDate><category>演算法</category><category>LeetCode</category><category>hashmap</category><category>Python</category></item><item><title>GitHub：打造高效團隊協作的新時代</title><link>https://alifestone.github.io/posts/github-team-collaboration/</link><guid isPermaLink="true">https://alifestone.github.io/posts/github-team-collaboration/</guid><description>用 what / why / how 三個面向介紹 GitHub 如何支撐團隊開發——版本控制、回朔、分支，以及從建立 repo 到 pull request 的完整流程。</description><pubDate>Tue, 06 May 2025 00:00:00 GMT</pubDate><category>資安 CTF</category><category>GitHub</category><category>git</category><category>團隊協作</category><category>教學</category></item><item><title>叡揚科技徵才說明會</title><link>https://alifestone.github.io/posts/gss-recruitment-briefing/</link><guid isPermaLink="true">https://alifestone.github.io/posts/gss-recruitment-briefing/</guid><description>叡揚科技徵才說明會的筆記——核心意識、自有平台、工作地點、職缺與培訓制度，以及現場 QA 的重點整理。</description><pubDate>Wed, 23 Apr 2025 00:00:00 GMT</pubDate><category>資安 CTF</category><category>職涯</category><category>實習</category><category>說明會</category></item><item><title>Bronco CTF</title><link>https://alifestone.github.io/posts/bronco-ctf/</link><guid isPermaLink="true">https://alifestone.github.io/posts/bronco-ctf/</guid><description>Bronco CTF 幾題的解法紀錄——從 fence 和 zig-zag 關鍵字認出柵欄密碼、經典 RSA 題，以及改寫 cookie 中 role 與 MD5 checksum。</description><pubDate>Mon, 03 Mar 2025 00:00:00 GMT</pubDate><category>資安 CTF</category><category>CTF</category><category>柵欄密碼</category><category>RSA</category><category>cookie</category><category>writeup</category></item><item><title>Remedy CTF 2025</title><link>https://alifestone.github.io/posts/remedy-ctf-2025/</link><guid isPermaLink="true">https://alifestone.github.io/posts/remedy-ctf-2025/</guid><description>以 solidity 區塊鏈題為主的比賽。雖然沒解出幾題，但整理了 RPC、智能合約、ABI、solidity 這些名詞的概念筆記。</description><pubDate>Wed, 29 Jan 2025 00:00:00 GMT</pubDate><category>資安 CTF</category><category>CTF</category><category>區塊鏈</category><category>solidity</category><category>智能合約</category><category>writeup</category></item><item><title>THIS IS A LEARNING NOTE</title><link>https://alifestone.github.io/posts/this-is-a-learning-note/</link><guid isPermaLink="true">https://alifestone.github.io/posts/this-is-a-learning-note/</guid><description>一篇滾動式更新的學習筆記，記錄那些不足以獨立成篇的小知識——Linux terminal 預設目錄、.bashrc 換 .zshrc，順便還有蛋炒飯。</description><pubDate>Tue, 05 Nov 2024 00:00:00 GMT</pubDate><category>資安 CTF</category><category>學習筆記</category><category>Linux</category><category>zsh</category><category>English</category></item><item><title>Hacker101_A little something to get you started 實戰分析</title><link>https://alifestone.github.io/posts/hacker101-a-little-something-to-get-you-started/</link><guid isPermaLink="true">https://alifestone.github.io/posts/hacker101-a-little-something-to-get-you-started/</guid><description>用 Burp Suite 的 HTTP history 找出網頁沒有呈現、卻確實被請求的 background.png——FLAG 就藏在它的 response 裡。</description><pubDate>Mon, 26 Aug 2024 00:00:00 GMT</pubDate><category>資安 CTF</category><category>Hacker101</category><category>Burp Suite</category><category>Web</category><category>writeup</category></item><item><title>picoCTF_cookies 實戰解析</title><link>https://alifestone.github.io/posts/picoctf-cookies/</link><guid isPermaLink="true">https://alifestone.github.io/posts/picoctf-cookies/</guid><description>遞增 cookie 值找出藏著 FLAG 的那一個。兩種爆破方式——Python requests 迴圈，以及 Burp Suite Intruder 搭配 Grep-Match / Grep-Extract。</description><pubDate>Tue, 20 Aug 2024 00:00:00 GMT</pubDate><category>資安 CTF</category><category>picoCTF</category><category>cookie</category><category>Burp Suite</category><category>Python</category><category>writeup</category></item><item><title>picoCTF_Mind your Ps and Qs 實戰解析</title><link>https://alifestone.github.io/posts/picoctf-mind-your-ps-and-qs/</link><guid isPermaLink="true">https://alifestone.github.io/posts/picoctf-mind-your-ps-and-qs/</guid><description>N 太小就能被分解。用 factordb 或 yafu 分解出 p、q 求得 𝜑，再以逆模運算拿到私鑰 d 解出明文。</description><pubDate>Sun, 12 May 2024 00:00:00 GMT</pubDate><category>資安 CTF</category><category>picoCTF</category><category>RSA</category><category>密碼學</category><category>Python</category><category>writeup</category></item><item><title>picoCTF_Tab,Tab,Attack 實戰解析</title><link>https://alifestone.github.io/posts/picoctf-tab-tab-attack/</link><guid isPermaLink="true">https://alifestone.github.io/posts/picoctf-tab-tab-attack/</guid><description>題如其名，考的是 Tab 鍵在 Linux Terminal 的自動補完。解壓縮後連按十一次 cd + Tab，再用 cat 打開檔案就拿到 flag。</description><pubDate>Sun, 12 May 2024 00:00:00 GMT</pubDate><category>資安 CTF</category><category>picoCTF</category><category>Linux</category><category>terminal</category><category>writeup</category></item><item><title>費馬小定理、尤拉定理、RSA 演算法證明</title><link>https://alifestone.github.io/posts/fermat-euler-rsa-proof/</link><guid isPermaLink="true">https://alifestone.github.io/posts/fermat-euler-rsa-proof/</guid><description>為了解 picoCTF 的 RSA 題而寫的數學筆記。費馬小定理好證，RSA 有尤拉定理也不難，真正頭疼的是尤拉定理本身的證明。</description><pubDate>Sat, 11 May 2024 00:00:00 GMT</pubDate><category>資安 CTF</category><category>密碼學</category><category>RSA</category><category>數學證明</category><category>費馬小定理</category><category>尤拉定理</category></item><item><title>picoCTF - Static ain&apos;t always noise 實戰解析</title><link>https://alifestone.github.io/posts/picoctf-static-aint-always-noise/</link><guid isPermaLink="true">https://alifestone.github.io/posts/picoctf-static-aint-always-noise/</guid><description>兩種解法——直接用 strings 搭配 grep 撈出 flag，或照題意執行 ltdis.sh 這支反組譯腳本。順帶處理 Permission denied。</description><pubDate>Thu, 09 May 2024 00:00:00 GMT</pubDate><category>資安 CTF</category><category>picoCTF</category><category>Linux</category><category>strings</category><category>objdump</category><category>writeup</category></item></channel></rss>