<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Z_zat的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/Z_zat</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Z_zat]]></copyright><item><title><![CDATA[力扣刷题记录&整理——（十八）Bit Manipulation]]></title><link>https://blog.youkuaiyun.com/Z_zat/article/details/138442896</link><guid>https://blog.youkuaiyun.com/Z_zat/article/details/138442896</guid><author>Z_zat</author><pubDate>Sun, 05 May 2024 15:45:31 +0800</pubDate><description><![CDATA[整理力扣刷题思路。语言：python题库：来自neetcode:link。]]></description><category></category></item><item><title><![CDATA[力扣刷题记录&整理——（十七）Math&Geometry]]></title><link>https://blog.youkuaiyun.com/Z_zat/article/details/138416368</link><guid>https://blog.youkuaiyun.com/Z_zat/article/details/138416368</guid><author>Z_zat</author><pubDate>Sat, 04 May 2024 15:26:19 +0800</pubDate><description><![CDATA[整理力扣刷题思路。语言：python题库：来自neetcode:link。]]></description><category></category></item><item><title><![CDATA[力扣刷题记录&整理——（十六）intervals]]></title><link>https://blog.youkuaiyun.com/Z_zat/article/details/138372361</link><guid>https://blog.youkuaiyun.com/Z_zat/article/details/138372361</guid><author>Z_zat</author><pubDate>Wed, 01 May 2024 16:16:58 +0800</pubDate><description><![CDATA[整理力扣刷题思路。语言：python题库：来自neetcode:link。]]></description><category></category></item><item><title><![CDATA[力扣刷题记录&整理——（十五）Greedy]]></title><link>https://blog.youkuaiyun.com/Z_zat/article/details/138323250</link><guid>https://blog.youkuaiyun.com/Z_zat/article/details/138323250</guid><author>Z_zat</author><pubDate>Tue, 30 Apr 2024 19:04:01 +0800</pubDate><description><![CDATA[整理力扣刷题思路。语言：python题库：来自neetcode:link。]]></description><category></category></item><item><title><![CDATA[力扣刷题记录&整理——（十四）2-D Dynamic Programming]]></title><link>https://blog.youkuaiyun.com/Z_zat/article/details/138186326</link><guid>https://blog.youkuaiyun.com/Z_zat/article/details/138186326</guid><author>Z_zat</author><pubDate>Sun, 28 Apr 2024 17:43:02 +0800</pubDate><description><![CDATA[整理力扣刷题思路。语言：python题库：来自neetcode:link。]]></description><category></category></item><item><title><![CDATA[力扣刷题记录&整理——（十三）1-D Dynamic Programming]]></title><link>https://blog.youkuaiyun.com/Z_zat/article/details/138030893</link><guid>https://blog.youkuaiyun.com/Z_zat/article/details/138030893</guid><author>Z_zat</author><pubDate>Wed, 24 Apr 2024 18:33:06 +0800</pubDate><description><![CDATA[整理力扣刷题思路。语言：python题库：来自neetcode:link。]]></description><category></category></item><item><title><![CDATA[力扣刷题记录&整理——（十二）Advanced Graphs]]></title><link>https://blog.youkuaiyun.com/Z_zat/article/details/137866428</link><guid>https://blog.youkuaiyun.com/Z_zat/article/details/137866428</guid><author>Z_zat</author><pubDate>Sat, 20 Apr 2024 15:44:27 +0800</pubDate><description><![CDATA[整理力扣刷题思路。语言：python题库：来自neetcode:link。]]></description><category></category></item><item><title><![CDATA[力扣刷题记录&整理——（十一）Graphs]]></title><link>https://blog.youkuaiyun.com/Z_zat/article/details/137629559</link><guid>https://blog.youkuaiyun.com/Z_zat/article/details/137629559</guid><author>Z_zat</author><pubDate>Tue, 16 Apr 2024 19:01:47 +0800</pubDate><description><![CDATA[整理力扣刷题思路。语言：python题库：来自neetcode:link。]]></description><category></category></item><item><title><![CDATA[力扣刷题记录&整理——（十）Backtracking]]></title><link>https://blog.youkuaiyun.com/Z_zat/article/details/137520386</link><guid>https://blog.youkuaiyun.com/Z_zat/article/details/137520386</guid><author>Z_zat</author><pubDate>Wed, 10 Apr 2024 12:47:14 +0800</pubDate><description><![CDATA[整理力扣刷题思路。语言：python题库：来自neetcode:link。]]></description><category></category></item><item><title><![CDATA[力扣刷题记录&整理——（九）Heap/Priority Queue]]></title><link>https://blog.youkuaiyun.com/Z_zat/article/details/137422918</link><guid>https://blog.youkuaiyun.com/Z_zat/article/details/137422918</guid><author>Z_zat</author><pubDate>Sun, 07 Apr 2024 15:46:04 +0800</pubDate><description><![CDATA[整理力扣刷题思路。语言：python题库：来自neetcode:link。]]></description><category></category></item><item><title><![CDATA[力扣刷题记录&整理——（八）Tries]]></title><link>https://blog.youkuaiyun.com/Z_zat/article/details/137397880</link><guid>https://blog.youkuaiyun.com/Z_zat/article/details/137397880</guid><author>Z_zat</author><pubDate>Fri, 05 Apr 2024 17:51:56 +0800</pubDate><description><![CDATA[整理力扣刷题思路。语言：python题库：来自neetcode:link。]]></description><category></category></item><item><title><![CDATA[力扣刷题记录&整理——（七）Trees]]></title><link>https://blog.youkuaiyun.com/Z_zat/article/details/137222867</link><guid>https://blog.youkuaiyun.com/Z_zat/article/details/137222867</guid><author>Z_zat</author><pubDate>Fri, 05 Apr 2024 00:26:47 +0800</pubDate><description><![CDATA[整理力扣刷题思路。语言：python题库：来自neetcode:link。]]></description><category></category></item><item><title><![CDATA[力扣刷题记录&整理——（六）Linked List]]></title><link>https://blog.youkuaiyun.com/Z_zat/article/details/137104467</link><guid>https://blog.youkuaiyun.com/Z_zat/article/details/137104467</guid><author>Z_zat</author><pubDate>Sun, 31 Mar 2024 13:48:49 +0800</pubDate><description><![CDATA[整理力扣刷题思路。语言：python题库：来自neetcode:link单链表是一种链式存取的数据结构，由一系列节点组成。每个节点包含两部分：DATA：自定义的数据类型，可以是整数、字符、结构体等。NEXT：指向下一个链表节点的指针。参考python代码的定义，单链表就是给定一个头节点（head），可以访问到节点值（head.val）和下一个节点（head.next）。]]></description><category></category></item><item><title><![CDATA[力扣刷题记录&整理——（五）Binary Search]]></title><link>https://blog.youkuaiyun.com/Z_zat/article/details/137018187</link><guid>https://blog.youkuaiyun.com/Z_zat/article/details/137018187</guid><author>Z_zat</author><pubDate>Wed, 27 Mar 2024 15:17:32 +0800</pubDate><description><![CDATA[整理力扣刷题思路。语言：python题库：来自neetcode:link。]]></description><category></category></item><item><title><![CDATA[力扣刷题记录&整理——（四）Stack]]></title><link>https://blog.youkuaiyun.com/Z_zat/article/details/136962747</link><guid>https://blog.youkuaiyun.com/Z_zat/article/details/136962747</guid><author>Z_zat</author><pubDate>Mon, 25 Mar 2024 16:27:28 +0800</pubDate><description><![CDATA[整理力扣刷题思路。语言：python题库：来自neetcode:link。]]></description><category></category></item><item><title><![CDATA[力扣刷题记录&整理——（三）Sliding Window]]></title><link>https://blog.youkuaiyun.com/Z_zat/article/details/136900569</link><guid>https://blog.youkuaiyun.com/Z_zat/article/details/136900569</guid><author>Z_zat</author><pubDate>Sat, 23 Mar 2024 00:24:32 +0800</pubDate><description><![CDATA[整理力扣刷题思路。语言：python题库：来自neetcode:link。]]></description><category></category></item><item><title><![CDATA[力扣刷题记录&整理——（二）Two Pointers]]></title><link>https://blog.youkuaiyun.com/Z_zat/article/details/136884455</link><guid>https://blog.youkuaiyun.com/Z_zat/article/details/136884455</guid><author>Z_zat</author><pubDate>Wed, 20 Mar 2024 21:31:54 +0800</pubDate><description><![CDATA[整理力扣刷题思路。语言：python题库：来自neetcode:link。]]></description><category></category></item><item><title><![CDATA[力扣刷题记录&整理——（一）Arrays & Hashing]]></title><link>https://blog.youkuaiyun.com/Z_zat/article/details/136780427</link><guid>https://blog.youkuaiyun.com/Z_zat/article/details/136780427</guid><author>Z_zat</author><pubDate>Tue, 19 Mar 2024 12:01:33 +0800</pubDate><description><![CDATA[整理力扣刷题思路。语言：python3题库：来自neetcode:link哈希表（Hash Table）是一种常见的数据结构，它提供了快速的数据检索能力。哈希表的核心是哈希函数，它负责将输入（通常是键值）映射到一个索引上，这个索引直接用于访问数据存储数组中的位置。链接:link。]]></description><category></category></item></channel></rss>