<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Bitmask on</title><link>https://h30306.github.io/blog/zh-tw/tags/bitmask/</link><description>Recent content in Bitmask on</description><generator>Hugo -- gohugo.io</generator><language>zh-tw</language><managingEditor>hwork0511@gmail.com (Wei Yi Chung)</managingEditor><webMaster>hwork0511@gmail.com (Wei Yi Chung)</webMaster><copyright>© 2026 Wei Yi Chung</copyright><lastBuildDate>Wed, 09 Sep 2026 00:00:00 +0000</lastBuildDate><atom:link href="https://h30306.github.io/blog/zh-tw/tags/bitmask/index.xml" rel="self" type="application/rss+xml"/><item><title>LeetCode 996: Number of Squareful Arrays</title><link>https://h30306.github.io/blog/zh-tw/leetcode/leetcode-996/</link><pubDate>Wed, 09 Sep 2026 00:00:00 +0000</pubDate><author>hwork0511@gmail.com (Wei Yi Chung)</author><guid>https://h30306.github.io/blog/zh-tw/leetcode/leetcode-996/</guid><description>LeetCode 996 解題筆記：n 最多 12，用 bitmask DP：dp[mask][last] = 用了 mask 這些數、最後一個是 last 的排列數；相同的數規定依 index 順序使用來去重</description><media:content xmlns:media="http://search.yahoo.com/mrss/" url="https://h30306.github.io/blog/leetcode/leetcode-996/featured.png"/></item><item><title>LeetCode 2376: Count Special Integers</title><link>https://h30306.github.io/blog/zh-tw/leetcode/leetcode-2376/</link><pubDate>Sat, 05 Sep 2026 00:00:00 +0000</pubDate><author>hwork0511@gmail.com (Wei Yi Chung)</author><guid>https://h30306.github.io/blog/zh-tw/leetcode/leetcode-2376/</guid><description>LeetCode 2376 解題筆記：數位 DP，狀態 (pos, tight, started, mask)；mask 記錄用過的數字，前導零不能算成用過 0</description><media:content xmlns:media="http://search.yahoo.com/mrss/" url="https://h30306.github.io/blog/leetcode/leetcode-2376/featured.png"/></item></channel></rss>