<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/"><channel><title>LeetCode 136 on Jeanphilo Blog</title><link>https://shio-chan-dev.github.io/jeanblog/zh/tags/leetcode-136/</link><description>Recent content in LeetCode 136 on Jeanphilo Blog</description><generator>Hugo -- 0.165.0</generator><language>zh-cn</language><lastBuildDate>Wed, 15 Jul 2026 00:00:00 +0800</lastBuildDate><atom:link href="https://shio-chan-dev.github.io/jeanblog/zh/tags/leetcode-136/index.xml" rel="self" type="application/rss+xml"/><item><title>LeetCode 136：只出现一次的数字，如何在常量空间排除重复元素</title><link>https://shio-chan-dev.github.io/jeanblog/zh/alg/leetcode/hot100/136-single-number/</link><pubDate>Wed, 15 Jul 2026 00:00:00 +0800</pubDate><guid>https://shio-chan-dev.github.io/jeanblog/zh/alg/leetcode/hot100/136-single-number/</guid><description>从集合配对 baseline 出发，推导 XOR 抵消重复元素，在线性时间和常量额外空间内解决 LeetCode 136。</description></item></channel></rss>