<?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>XOR on Answer</title>
    <link>https://answer.freetools.me/tags/xor/</link>
    <description>Recent content in XOR on Answer</description>
    <generator>Hugo -- 0.152.2</generator>
    <language>zh-cn</language>
    <lastBuildDate>Sun, 08 Mar 2026 22:03:27 +0800</lastBuildDate>
    <atom:link href="https://answer.freetools.me/tags/xor/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>位运算为何能让一行代码抵十行循环从底层原理到LeetCode完整通关指南</title>
      <link>https://answer.freetools.me/%E4%BD%8D%E8%BF%90%E7%AE%97%E4%B8%BA%E4%BD%95%E8%83%BD%E8%AE%A9%E4%B8%80%E8%A1%8C%E4%BB%A3%E7%A0%81%E6%8A%B5%E5%8D%81%E8%A1%8C%E5%BE%AA%E7%8E%AF%E4%BB%8E%E5%BA%95%E5%B1%82%E5%8E%9F%E7%90%86%E5%88%B0leetcode%E5%AE%8C%E6%95%B4%E9%80%9A%E5%85%B3%E6%8C%87%E5%8D%97/</link>
      <pubDate>Sun, 08 Mar 2026 22:03:27 +0800</pubDate>
      <guid>https://answer.freetools.me/%E4%BD%8D%E8%BF%90%E7%AE%97%E4%B8%BA%E4%BD%95%E8%83%BD%E8%AE%A9%E4%B8%80%E8%A1%8C%E4%BB%A3%E7%A0%81%E6%8A%B5%E5%8D%81%E8%A1%8C%E5%BE%AA%E7%8E%AF%E4%BB%8E%E5%BA%95%E5%B1%82%E5%8E%9F%E7%90%86%E5%88%B0leetcode%E5%AE%8C%E6%95%B4%E9%80%9A%E5%85%B3%E6%8C%87%E5%8D%97/</guid>
      <description>一篇系统讲解位运算的深度教程，从二进制基础到Brian Kernighan算法，从XOR性质到lowbit技巧，结合LeetCode经典题目（Single Number系列、Counting Bits、Hamming Distance、Sum of Two Integers等）的完整Java实现与复杂度分析。</description>
    </item>
  </channel>
</rss>
