<?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 338 on Jeanphilo Blog</title><link>https://shio-chan-dev.github.io/jeanblog/zh/tags/leetcode-338/</link><description>Recent content in LeetCode 338 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-338/index.xml" rel="self" type="application/rss+xml"/><item><title>LeetCode 338：比特位计数，如何复用较小数字的结果</title><link>https://shio-chan-dev.github.io/jeanblog/zh/alg/leetcode/hot100/338-counting-bits/</link><pubDate>Wed, 15 Jul 2026 00:00:00 +0800</pubDate><guid>https://shio-chan-dev.github.io/jeanblog/zh/alg/leetcode/hot100/338-counting-bits/</guid><description>从对 0..n 每个数字重复统计的 baseline 出发，推导 answer[i] = answer[i &amp;amp; (i - 1)] + 1，在线性时间内完成比特位计数。</description></item></channel></rss>