<?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 on Dai Chao</title>
    <link>https://daichao1997.github.io/tags/leetcode/</link>
    <description>Recent content in LeetCode on Dai Chao</description>
    <generator>Hugo</generator>
    <language>zh-cn</language>
    <lastBuildDate>Mon, 13 Jul 2020 00:00:00 +0800</lastBuildDate>
    <atom:link href="https://daichao1997.github.io/tags/leetcode/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>记一次愚蠢的Leetcode刷题</title>
      <link>https://daichao1997.github.io/posts/tech/2020-07-13-median-of-two-sorted-arrays/</link>
      <pubDate>Mon, 13 Jul 2020 00:00:00 +0800</pubDate>
      <guid>https://daichao1997.github.io/posts/tech/2020-07-13-median-of-two-sorted-arrays/</guid>
      <description>&lt;p&gt;一道并不怎么难的题，提交了N次才成功，究其原因是边缘情况特别多，所以一定得好好复盘，练好我一直写不清楚的二分法——我经常绕不清楚奇偶两种情况，也常常照顾不好数组越界。&lt;/p&gt;</description>
    </item>
  </channel>
</rss>
