<?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 1282 on Jeanphilo Blog</title><link>https://jeanphilogong.github.io/jeanblog/zh/tags/leetcode-1282/</link><description>Recent content in LeetCode 1282 on Jeanphilo Blog</description><generator>Hugo -- 0.168.0</generator><language>zh-cn</language><lastBuildDate>Sat, 10 Oct 2026 10:00:00 +0800</lastBuildDate><atom:link href="https://jeanphilogong.github.io/jeanblog/zh/tags/leetcode-1282/index.xml" rel="self" type="application/rss+xml"/><item><title>LeetCode 1282：用户分组，从相同容量分桶到满组即输出</title><link>https://jeanphilogong.github.io/jeanblog/zh/alg/leetcode/1282-group-the-people-given-the-group-size-they-belong-to/</link><pubDate>Sat, 10 Oct 2026 10:00:00 +0800</pubDate><guid>https://jeanphilogong.github.io/jeanblog/zh/alg/leetcode/1282-group-the-people-given-the-group-size-they-belong-to/</guid><description>从用户编号与组大小的区别出发，先按容量收集再分块，逐步写出满组即输出的 Python 解法，解释列表引用陷阱、正确性与线性复杂度。</description></item></channel></rss>