https://h30306.github.io/blog/zh-tw/tags/floyds-cycle-finding-algorithm/Recent content in Floyds-Cycle-Finding-Algorithm onHugo -- gohugo.iozh-twhwork0511@gmail.com (Wei Yi Chung)hwork0511@gmail.com (Wei Yi Chung)© 2026 Wei Yi ChungMon, 14 Nov 2022 00:00:00 +0000https://h30306.github.io/blog/zh-tw/leetcode/leetcode-142/Mon, 14 Nov 2022 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/zh-tw/leetcode/leetcode-142/LeetCode 142 解題筆記：快慢指針相遇後，一個回到 head，兩個都一次一步，再相遇的地方就是環的入口https://h30306.github.io/blog/zh-tw/leetcode/leetcode-202/Sun, 21 Aug 2022 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/zh-tw/leetcode/leetcode-202/LeetCode 202 解題筆記：一直取位數平方和，會走到 1 或進入環；用集合記看過的數，或用快慢指針判圈https://h30306.github.io/blog/zh-tw/leetcode/leetcode-141/Sat, 20 Aug 2022 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/zh-tw/leetcode/leetcode-141/LeetCode 141 解題筆記：Floyd 判圈，快指針一次兩步、慢指針一次一步，有環就一定會相遇；兩個都要從自己的位置往前走