知识点地址: 快慢指针应用: (1)判断单链表是否存在环 (2)在有序链表中寻找中位数 (3) 输出链表中的倒数第K个节点(即正数第K-1个节点) Leetcode 第19题 (4) 判断链表是否存在环,如果存在,找到环入口 (5) 判断两个单链表是否相交,如果相交,找到他们的第一个公共节点 第四题详解: 知识点地址: https://blog.csdn.net/qq_21815981/article/details/79833976?ops_request_misc=%257B%2522request%255Fid%2522%253A%2522162686640916780261919706%2522%252C%2522scm%2522%253A%252220140713.130102334..%2522%257D&request_id=162686640916780261919706&biz_id=0&utm_medium=distribute.pc_search_result.none-task-blog-2~all~top_positive~default-1-79833976.first_rank_v2_pc_rank_v29&utm_term=%E5%BF%AB%E6%85%A2%E6%8C%87%E9%92%88&spm=1018.2226.3001.4187 快慢指针应用: (1)判断单链表是否存在环 (2)在有序链表中寻找中位数 (3) 输出链表中的倒数第K个节点(即正数第K-1个节点) Leetcode 第19题 本题并没有头结点,所以需要建立一个哑结点来充当头结点。 (4) 判断链表是否存在环,如果存在,找到环入口 (5) 判断两个单链表是否相交,如果相交,找到他们的第一个公共节点 第四题详解: https://blog.csdn.net/sinat_35261315/article/details/79205157?ops_request_misc=%257B%2522request%255Fid%2522%253A%2522162687346616780366528141%2522%252C%2522scm%2522%253A%252220140713.130102334..%2522%257D&request_id=162687346616780366528141&biz_id=0&utm_medium=distribute.pc_search_result.none-task-blog-2~all~sobaiduend~default-2-79205157.first_rank_v2_pc_rank_v29&utm_term=++%E5%88%A4%E6%96%AD%E9%93%BE%E8%A1%A8%E6%98%AF%E5%90%A6%E5%AD%98%E5%9C%A8%E7%8E%AF%EF%BC%8C%E5%A6%82%E6%9E%9C%E5%AD%98%E5%9C%A8%EF%BC%8C%E6%89%BE%E5%88%B0%E7%8E%AF%E5%85%A5%E5%8F%A3 https://blog.csdn.net/weixin_42078660/article/details/89265288?ops_request_misc=%257B%2522request%255Fid%2522%253A%2522162687346616780366528141%2522%252C%2522scm%2522%253A%252220140713.130102334..%2522%257D&request_id=162687346616780366528141&biz_id=0&utm_medium=distribute.pc_search_result.none-task-blog-2~all~sobaiduend~default-1-89265288.first_rank_v2_pc_rank_v29&utm_term=++%E5%88%A4%E6%96%AD%E9%93%BE%E8%A1%A8%E6%98%AF%E5%90%A6%E5%AD%98%E5%9C%A8%E7%8E%AF%EF%BC%8C%E5%A6%82%E6%9E%9C%E5%AD%98%E5%9C%A8%EF%BC%8C%E6%89%BE%E5%88%B0%E7%8E%AF%E5%85%A5%E5%8F%A3&spm=1018.2226.3001.4187