<rss xmlns:atom="http://www.w3.org/2005/Atom" version="2.0">
    <channel>
        <title>Linked List - 标签 - zwyyy456&#39;s blog</title>
        <link>https://doit.tellm.eu.org/zh/tags/linked-list/</link>
        <description>Linked List - 标签 - zwyyy456&#39;s blog</description>
        <generator>Hugo -- gohugo.io</generator><language>zh</language><managingEditor>zwyyy456@hotmail.com (zwyyy456)</managingEditor>
            <webMaster>zwyyy456@hotmail.com (zwyyy456)</webMaster><copyright>This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.</copyright><lastBuildDate>Mon, 28 Nov 2022 13:46:16 &#43;0800</lastBuildDate><atom:link href="https://doit.tellm.eu.org/zh/tags/linked-list/" rel="self" type="application/rss+xml" /><item>
    <title>142.环形链表II</title>
    <link>https://doit.tellm.eu.org/zh/142.linked-list-cycle-ii/</link>
    <pubDate>Mon, 28 Nov 2022 13:46:16 &#43;0800</pubDate><author>
                    <name>zwyyy456</name>
                </author><guid>https://doit.tellm.eu.org/zh/142.linked-list-cycle-ii/</guid>
    <description><![CDATA[1 问题描述142.环形链表II 2 解题思路判断是否链表是否存在环的方式与141.环形链表一致，当两个指针相遇时，再让一个指针从虚拟头节点开始一]]></description>
</item><item>
    <title>141.环形链表</title>
    <link>https://doit.tellm.eu.org/zh/141.linked-list-cycle/</link>
    <pubDate>Sun, 27 Nov 2022 21:09:11 &#43;0800</pubDate><author>
                    <name>zwyyy456</name>
                </author><guid>https://doit.tellm.eu.org/zh/141.linked-list-cycle/</guid>
    <description><![CDATA[1 问题描述141.环形链表 2 解题思路使用快慢两个指针，fast一次移动两个节点，slow一次移动一个节点，如果链表存在环，那么fast和sl]]></description>
</item></channel>
</rss>
