{"id":98,"date":"2025-09-15T16:08:55","date_gmt":"2025-09-15T08:08:55","guid":{"rendered":"https:\/\/yxzhangcoco.xyz\/?p=98"},"modified":"2025-09-15T23:22:14","modified_gmt":"2025-09-15T15:22:14","slug":"%e9%93%be%e8%a1%a8","status":"publish","type":"post","link":"https:\/\/yxzhangcoco.xyz\/index.php\/2025\/09\/15\/%e9%93%be%e8%a1%a8\/","title":{"rendered":"\u94fe\u8868"},"content":{"rendered":"\n

\u6700\u8fd1\u901a\u8fc7leetcode\u5237\u9898\u590d\u4e60\u94fe\u8868\u76f8\u5173\u7684\u77e5\u8bc6\uff0c\u5c06\u5176\u5212\u5206\u4e3a\u4e09\u5927\u90e8\u5206\uff0c\u5206\u522b\u662f\u94fe\u8868\u57fa\u7840\u64cd\u4f5c\u3001\u8fdb\u9636\u6280\u5de7\u3001\u7efc\u5408\u9898\u578b\u3002<\/p>\n\n\n\n

\u4e00\u3001\u94fe\u8868\u57fa\u7840\u64cd\u4f5c<\/h3>\n\n\n\n

1\uff0c\u54e8\u5175\u8282\u70b9<\/h3>\n\n\n\n

\u54e8\u5175\u8282\u70b9\u53ca\u5728\u94fe\u8868\u7684\u5934\u8282\u70b9\u4e4b\u524d\u521b\u5efa\u4e00\u4e2a\u65e0\u503c\uff0c\u6307\u5411\u5934\u8282\u70b9\u7684\u865a\u62df\u8282\u70b9\uff0c\u4f5c\u4e3a\u65b0\u7684\u64cd\u4f5c\u8282\u70b9\uff0c\u8be5\u64cd\u4f5c\u53ef\u4ee5\u907f\u514d\u8bf8\u5982\u524d\u9a71\u8282\u70b9\u5224\u65ad\u3001\u5934\u8282\u70b9\u64cd\u4f5c\u3001\u7a7a\u94fe\u8868\u5904\u7406\u65f6\u7684\u5206\u7c7b\u8ba8\u8bba\u3002<\/p>\n\n\n\n

\u4f8b\u98981\uff1aleetcode707\uff1a\u8bbe\u8ba1\u94fe\u8868<\/a><\/p>\n\n\n\n

\u4f60\u53ef\u4ee5\u9009\u62e9\u4f7f\u7528\u5355\u94fe\u8868\u6216\u8005\u53cc\u94fe\u8868\uff0c\u8bbe\u8ba1\u5e76\u5b9e\u73b0\u81ea\u5df1\u7684\u94fe\u8868\u3002<\/p>\n\n\n\n

\u5355\u94fe\u8868\u4e2d\u7684\u8282\u70b9\u5e94\u8be5\u5177\u5907\u4e24\u4e2a\u5c5e\u6027\uff1aval<\/code> \u548c next<\/code> \u3002val<\/code> \u662f\u5f53\u524d\u8282\u70b9\u7684\u503c\uff0cnext<\/code> \u662f\u6307\u5411\u4e0b\u4e00\u4e2a\u8282\u70b9\u7684\u6307\u9488\/\u5f15\u7528\u3002<\/p>\n\n\n\n

\u5982\u679c\u662f\u53cc\u5411\u94fe\u8868\uff0c\u5219\u8fd8\u9700\u8981\u5c5e\u6027 prev<\/code> \u4ee5\u6307\u793a\u94fe\u8868\u4e2d\u7684\u4e0a\u4e00\u4e2a\u8282\u70b9\u3002\u5047\u8bbe\u94fe\u8868\u4e2d\u7684\u6240\u6709\u8282\u70b9\u4e0b\u6807\u4ece 0<\/strong> \u5f00\u59cb\u3002<\/p>\n\n\n\n

\u5206\u6790\uff1a\u8be5\u9898\u9700\u8981\u7b14\u8005\u8bbe\u8ba1\u4e00\u4e2a\u94fe\u8868\u7684\u7c7b\uff0c\u6ee1\u8db3\u589e\u5220\u6539\u67e5\u7684\u6838\u5fc3\u529f\u80fd\uff0c\u7531\u6b64\u6211\u4eec\u9700\u8981\u6ce8\u610f\uff0c\u5f53\u5934\u8282\u70b9\u4e3a\u7a7a\u65f6\u4f1a\u51fa\u73b0\u5206\u7c7b\u8ba8\u8bba\u7684\u60c5\u51b5\uff0c\u4f46\u4f7f\u7528\u865a\u62df\u5934\u8282\u70b9\u53ef\u4ee5\u5f88\u597d\u7684\u907f\u514d\u8ba8\u8bba\u8fd9\u4e00\u70b9\u3002\u4e0e\u6b64\u540c\u65f6\uff0c\u4f7f\u7528size\u8bb0\u5f55\u94fe\u8868\u5927\u5c0f\u4e5f\u53ef\u4ee5\u5f88\u597d\u7684\u6765\u5224\u65ad\u5f53\u524d\u4e0b\u6807\u662f\u5426\u8d8a\u754c\u3002<\/p>\n\n\n\n

from typing import Optional\nclass ListNode:\n    def __init__(self,val):\n        self.val=val\n        self.next=None\n\nclass MyLinkedList:\n\n    def __init__(self):\n        self.head=ListNode(0)\n        self.size=0\n    def get(self, index: int) -> int:\n        if index<0 or index>=self.size:\n            return -1\n        head=self.head\n        for i in range(index+1):\n            head=head.next\n        return head.val\n    def addAtHead(self, val: int) -> None:\n        Node=ListNode(val)\n        head=self.head\n        Node.next=head.next\n        head.next=Node\n        self.size+=1\n    def addAtTail(self, val: int) -> None:\n        Node=ListNode(val)\n        head=self.head\n        while head.next:\n            head=head.next\n        head.next=Node\n        self.size+=1\n    def addAtIndex(self, index: int, val: int) -> None:\n        if index<0 or index>self.size:\n            return \n        Node=ListNode(val)\n        head=self.head\n        for i in range (index):\n            head=head.next\n        Node.next=head.next\n        head.next=Node\n        self.size+=1\n    def deleteAtIndex(self, index: int) -> None:\n        if index<0 or index>=self.size:\n            return \n        head=self.head\n        for i in range(index):\n            head=head.next\n        head.next=head.next.next\n        self.size-=1\n# Your MyLinkedList object will be instantiated and called as such:\n# obj = MyLinkedList()\n# param_1 = obj.get(index)\n# obj.addAtHead(val)\n# obj.addAtTail(val)\n# obj.addAtIndex(index,val)\n# obj.deleteAtIndex(index)<\/code><\/pre>\n\n\n\n
2\uff0c\u94fe\u8868\u7684\u4e2d\u95f4\u8282\u70b9<\/h3>\n\n\n\n
\u94fe\u8868\u7684\u4e2d\u95f4\u8282\u70b9\uff0c\u53ef\u4ee5\u7528\u5feb\u6162\u6307\u9488\u7684\u5f62\u5f0f\u5feb\u901f\u627e\u5230<\/p>\n\n\n\n
\u4f8b\u98982\uff1aleetcode876\uff1a\u94fe\u8868\u7684\u4e2d\u95f4\u8282\u70b9<\/a><\/p>\n\n\n\n
\u7ed9\u4f60\u5355\u94fe\u8868\u7684\u5934\u7ed3\u70b9 head \uff0c\u8bf7\u4f60\u627e\u51fa\u5e76\u8fd4\u56de\u94fe\u8868\u7684\u4e2d\u95f4\u7ed3\u70b9\u3002<\/p>\n\n\n\n
\u5982\u679c\u6709\u4e24\u4e2a\u4e2d\u95f4\u7ed3\u70b9\uff0c\u5219\u8fd4\u56de\u7b2c\u4e8c\u4e2a\u4e2d\u95f4\u7ed3\u70b9\u3002<\/p>\n\n\n\n
from typing import Optional\n# Definition for singly-linked list.\nclass ListNode:\n    def __init__(self, val=0, next=None):\n        self.val = val\n        self.next = next\nclass Solution:\n    def middleNode(self, head: Optional[ListNode]) -> Optional[ListNode]:\n        if head==None:\n            return None\n        fast=slow=head\n        while fast and fast.next!=None:\n            fast=fast.next.next\n            slow=slow.next\n        return slow\n\"\"\"\n\u503c\u5f97\u6ce8\u610f\u7684\u662f\uff0c\u5f53slow=head.next\u800cfast=head\u65f6\uff0cslow\u6700\u540e\u6307\u5411\u7684\u662f\u504f\u53f3\u7684\u4e2d\u95f4\u8282\u70b9\u3002\n\u4e0a\u8ff0\u5f97\u5230\u7684\u662f\u504f\u5de6\u7684\u4e2d\u95f4\u8282\u70b9\n\"\"\"<\/code><\/pre>\n\n\n\n
3,\u7ffb\u8f6c\u94fe\u8868<\/h3>\n\n\n\n
\u4f8b\u98983\uff1aleetcodeLCR024\uff1a\u7ffb\u8f6c\u94fe\u8868<\/a><\/p>\n\n\n\n
\u7ffb\u8f6c\u94fe\u8868\u53ef\u4ee5\u7528\u4e24\u79cd\u65b9\u6cd5\u6765\u5199\uff0c\u7b2c\u4e00\u79cd\u662f\u8fed\u4ee3\uff0c\u7b2c\u4e8c\u79cd\u5219\u662f\u5206\u6cbb\u6cd5\uff0c\u4e24\u5468\u65b9\u6cd5\u90fd\u975e\u5e38\u7ecf\u5178\uff0c\u4e5f\u6709\u5fc5\u8981\u638c\u63e1\uff0c\u540c\u65f6\u7ffb\u8f6c\u94fe\u8868\u4e5f\u662f\u540e\u7eed\u8bf8\u591a\u590d\u6742\u64cd\u4f5c\u7684\u57fa\u7840\u3002<\/p>\n\n\n\n
\u65b9\u6cd5\u4e00\uff1a\u8fed\u4ee3\u6cd5<\/p>\n\n\n\n
# Definition for singly-linked list.\nfrom typing import Optional\nclass ListNode:\n    def __init__(self, val=0, next=None):\n        self.val = val\n        self.next = next\nclass Solution:\n    def reverseList(self, head: Optional[ListNode]) -> Optional[ListNode]:\n        if head is None or head.next is None:\n            return head\n        pre=None\n        cur=head\n        while cur:\n            temp=cur.next\n            cur.next=pre\n            pre=cur\n            cur=temp\n        return pre<\/code><\/pre>\n\n\n\n
\u8fed\u4ee3\u6cd5\u91cd\u5728pre\u4e0ecur\u6307\u9488\u7684\u76f8\u4e92\u8d4b\u503c\uff0c\u503c\u5f97\u6ce8\u610f\u7684\u662f\uff0cpre\u521d\u59cb\u4e3aNone\uff0ccur\u521d\u59cb\u4e3ahead\uff0c\u8fd9\u6837\u53ef\u4ee5\u4e00\u76f4\u904d\u5386\u4e3apre\u4e3a\u65b0\u7684\u5934\u8282\u70b9\uff0c\u800ccur\u4e3aNone<\/p>\n\n\n\n
\u65b9\u6cd5\u4e8c\uff1a\u5206\u652f\u6cd5<\/p>\n\n\n\n
\"\"<\/div><\/figure>\n\n\n\n
# Definition for singly-linked list.\nfrom typing import Optional\nclass ListNode:\n    def __init__(self, val=0, next=None):\n        self.val = val\n        self.next = next\nclass Solution:\n    def reverseList(self, head: Optional[ListNode]) -> Optional[ListNode]:\n        if head is None or head.next is None:\n            return head\n        new_head= self.reverseList(head.next)\n        head.next.next=head\n        head.next=None\n        return new_head<\/code><\/pre>\n\n\n\n
4,\u6c42\u5f97\u94fe\u8868\u7684\u5012\u6570\u7b2cN\u4e2a\u8282\u70b9<\/h3>\n\n\n\n
\u4f8b\u98984\uff1aleetcode19\uff1a\u5220\u9664\u94fe\u8868\u7684\u5012\u6570\u7b2cN\u4e2a\u8282\u70b9<\/a><\/p>\n\n\n\n
\u94fe\u8868\u7684\u5012\u662f\u7b2cN\u4e2a\u8282\u70b9\u53ef\u4ee5\u7528\u8d77\u59cb\u70b9\u4e0d\u540c\u7684\u6307\u9488\u53bb\u6c42\u5f97\uff0c\u6ce8\u610f\u4e0d\u662f\u5feb\u6162\u6307\u9488\u800c\u662f\u8d77\u59cb\u70b9\u4e0d\u540c\u7684\u6307\u9488\uff0c\u53ea\u9700\u8981\u8ba9\u524d\u4e00\u4e2a\u6307\u9488\u6bd4\u540e\u4e00\u4e2a\u6307\u9488\u6052\u5b9a\u5febN\u6b65\uff0c\u90a3\u4e48\u5f53\u524d\u4e00\u4e2a\u6307\u9488\u6307\u5411\u5c3e\u8282\u70b9\u65f6\uff0c\u540e\u4e00\u4e2a\u6307\u9488\u5c31\u662f\u5012\u6570\u7b2cN\u4e2a\u8282\u70b9\u3002<\/p>\n\n\n\n
from typing import Optional\n# Definition for singly-linked list.\n\nclass ListNode:\n    def __init__(self, val=0, next=None):\n        self.val = val\n        self.next = next\nclass Solution:\n    def removeNthFromEnd(self, head: Optional[ListNode], n: int) -> Optional[ListNode]:\n        fast=head\n        slow=head\n        for i in range(n):\n            fast=fast.next\n        if fast==None:\n            return head.next\n        while fast.next:\n            fast=fast.next\n            slow=slow.next\n        slow.next=slow.next.next\n        return head\n\nif __name__ == '__main__':\n    head = ListNode(1)\n    head.next = ListNode(2)\n    head.next.next = ListNode(3)\n    head.next.next.next = ListNode(4)\n    head.next.next.next.next = ListNode(5)\n    n = 2\n    s = Solution()\n    s.removeNthFromEnd(head, n)\n<\/code><\/pre>\n\n\n\n
5\uff0c\u94fe\u8868\u7684\u5206\u5272\u5904\u7406\u64cd\u4f5c<\/h3>\n\n\n\n
\u4f8b\u98985\uff1aleetcode328\uff1a\u5947\u5076\u94fe\u8868<\/a><\/p>\n\n\n\n
\u7ed9\u5b9a\u5355\u94fe\u8868\u7684\u5934\u8282\u70b9 head<\/code> \uff0c\u5c06\u6240\u6709\u7d22\u5f15\u4e3a\u5947\u6570\u7684\u8282\u70b9\u548c\u7d22\u5f15\u4e3a\u5076\u6570\u7684\u8282\u70b9\u5206\u522b\u5206\u7ec4\uff0c\u4fdd\u6301\u5b83\u4eec\u539f\u6709\u7684\u76f8\u5bf9\u987a\u5e8f\uff0c\u7136\u540e\u628a\u5076\u6570\u7d22\u5f15\u8282\u70b9\u5206\u7ec4\u8fde\u63a5\u5230\u5947\u6570\u7d22\u5f15\u8282\u70b9\u5206\u7ec4\u4e4b\u540e\uff0c\u8fd4\u56de\u91cd\u65b0\u6392\u5e8f\u7684\u94fe\u8868\u3002<\/p>\n\n\n\n
\u7b2c\u4e00\u4e2a<\/strong>\u8282\u70b9\u7684\u7d22\u5f15\u88ab\u8ba4\u4e3a\u662f \u5947\u6570<\/strong> \uff0c \u7b2c\u4e8c\u4e2a<\/strong>\u8282\u70b9\u7684\u7d22\u5f15\u4e3a \u5076\u6570<\/strong> \uff0c\u4ee5\u6b64\u7c7b\u63a8\u3002<\/p>\n\n\n\n
\u8bf7\u6ce8\u610f\uff0c\u5076\u6570\u7ec4\u548c\u5947\u6570\u7ec4\u5185\u90e8\u7684\u76f8\u5bf9\u987a\u5e8f\u5e94\u8be5\u4e0e\u8f93\u5165\u65f6\u4fdd\u6301\u4e00\u81f4\u3002<\/p>\n\n\n\n
\u4f60\u5fc5\u987b\u5728 O(1) \u7684\u989d\u5916\u7a7a\u95f4\u590d\u6742\u5ea6\u548c O(n) \u7684\u65f6\u95f4\u590d\u6742\u5ea6\u4e0b\u89e3\u51b3\u8fd9\u4e2a\u95ee\u9898\u3002<\/p>\n\n\n\n
\u9898\u76ee\u8981\u6c42\u5c06\u94fe\u8868\u4ee5\u5947\u5076\u7684\u5f62\u5f0f\u8fdb\u884c\u5206\u5272\uff0c\u6b64\u65f6\u5982\u679c\u5c06\u94fe\u8868\u89c6\u4e3a\u4e00\u4e2a\u94fe\u8868\uff0c\u4f1a\u5bfc\u81f4\u975e\u5e38\u590d\u6742\u7684\u53cc\u6307\u9488\u64cd\u4f5c\uff0c\u4f46\u662f\u5982\u679c\u89c6\u4e3a\u4e24\u4e2a\u94fe\u8868\u4e00\u4e2a\u8d1f\u8d23\u7a7f\u5947\u6570\uff0c\u4e00\u4e2a\u8d1f\u8d23\u7a7f\u5076\u6570\uff0c\u6700\u540e\u5c06\u4e24\u4e2a\u94fe\u8868\u8fde\u8d77\u6765\uff0c\u90a3\u4e48\u9898\u76ee\u5c06\u4f1a\u7b80\u5355\u4e00\u4e2a\u5c42\u6b21\u3002<\/p>\n\n\n\n
# Definition for singly-linked list.\nfrom typing import Optional\nclass ListNode:\n    def __init__(self, val=0, next=None):\n        self.val = val\n        self.next = next\nclass Solution:\n    def oddEvenList(self, head: Optional[ListNode]) -> Optional[ListNode]:\n        if head==None:\n            return None\n        odd=head\n        even=head.next\n        even_head=even\n        while even and even.next:\n            odd.next=even.next\n            odd=odd.next\n            even.next=odd.next\n            even=even.next\n        odd.next=even_head\n        return head<\/code><\/pre>\n\n\n\n
\u4e8c\u3001\u94fe\u8868\u8fdb\u9636\u64cd\u4f5c<\/h3>\n\n\n\n
1\uff0c\u5206\u5272\u94fe\u8868<\/h3>\n\n\n\n
\u53ea\u9700\u660e\u767d\u5c06\u4e00\u4e2a\u94fe\u8868\u89c6\u4e3a\u4e24\u4e2a\u94fe\u8868\u5e76\u5206\u522b\u7a7f\u63d2\u5373\u53ef\u3002<\/p>\n\n\n\n
\u4f8b\u98981\uff1aleetcode86\uff1a\u5206\u9694\u94fe\u8868<\/a><\/p>\n\n\n\n
\u7ed9\u4f60\u4e00\u4e2a\u94fe\u8868\u7684\u5934\u8282\u70b9 head \u548c\u4e00\u4e2a\u7279\u5b9a\u503c <\/em>x<\/code> \uff0c\u8bf7\u4f60\u5bf9\u94fe\u8868\u8fdb\u884c\u5206\u9694\uff0c\u4f7f\u5f97\u6240\u6709 \u5c0f\u4e8e<\/strong> x<\/code> \u7684\u8282\u70b9\u90fd\u51fa\u73b0\u5728 \u5927\u4e8e\u6216\u7b49\u4e8e<\/strong> x<\/code> \u7684\u8282\u70b9\u4e4b\u524d\u3002<\/p>\n\n\n\n
\u4f60\u5e94\u5f53 \u4fdd\u7559<\/strong> \u4e24\u4e2a\u5206\u533a\u4e2d\u6bcf\u4e2a\u8282\u70b9\u7684\u521d\u59cb\u76f8\u5bf9\u4f4d\u7f6e\u3002\u540c\u65f6\uff0c\u4e3a\u4e86\u907f\u514d\u5206\u7c7b\u8ba8\u8bba\uff0c\u4e00\u5b9a\u8981\u4f7f\u7528\u865a\u62df\u5934\u8282\u70b9\u3002<\/p>\n\n\n\n
from typing import Optional\nclass ListNode:\n    def __init__(self, val=0, next=None):\n        self.val = val\n        self.next = next\nclass Solution:\n    def partition(self, head: Optional[ListNode], x: int) -> Optional[ListNode]:\n        lower_head=ListNode(0)\n        higher_head=ListNode(0)\n        \n        lower=lower_head\n        higher=higher_head\n        \n        p=head\n        \n        while p:\n            if p.val<x:\n                lower.next=p\n                lower=lower.next\n            else:\n                higher.next=p\n                higher=higher.next\n            p=p.next\n        higher.next=None\n        \n        lower.next=higher_head.next\n        \n        return lower_head.next\n<\/code><\/pre>\n\n\n\n
2\uff0c\u65cb\u8f6c\u94fe\u8868<\/h3>\n\n\n\n
\u6240\u8c13\u65cb\u8f6c\u94fe\u8868\uff0c\u5c31\u662f\u5c06\u94fe\u8868\u50cf\u6570\u7ec4\u4e00\u6837\u53f3\u5faa\u73af\u6216\u8005\u5de6\u5faa\u73af\u504f\u79fb\uff0c\u4e0e\u6570\u7ec4\u9700\u8981reverse\u4e0d\u540c\u7684\u662f\uff0c\u94fe\u8868\u53ea\u9700\u8981\u627e\u5230\u5012\u6570\u7684N\u8282\u70b9\u4ee5\u53ca\u4f7f\u7528\u5934\u8282\u70b9\u5373\u53ef\u3002<\/p>\n\n\n\n
\u4f8b\u98982\uff1aleetcode61\uff1a\u65cb\u8f6c\u94fe\u8868<\/a><\/p>\n\n\n\n
\u7ed9\u4f60\u4e00\u4e2a\u94fe\u8868\u7684\u5934\u8282\u70b9 head \uff0c\u65cb\u8f6c\u94fe\u8868\uff0c\u5c06\u94fe\u8868\u6bcf\u4e2a\u8282\u70b9\u5411\u53f3\u79fb\u52a8 k<\/code> <\/em>\u4e2a\u4f4d\u7f6e\u3002<\/p>\n\n\n\n
\u9996\u5148\u5c06k%len\uff0c\u5f97\u5230\u771f\u6b63\u9700\u8981\u53f3\u79fb\u7684\u4f4d\u6570\uff0c\u968f\u540e\u4f7f\u7528\u5bfb\u627e\u5012\u6570\u7b2cN\u4e2a\u8282\u70b9\u7684\u65b9\u6cd5\u6765\u5f97\u5230\u5173\u952e\u8282\u70b9\uff0c\u6700\u540e\u7a7f\u63d2\u5373\u53ef\u3002<\/p>\n\n\n\n
# Definition for singly-linked list.\nfrom typing import Optional\nclass ListNode:\n    def __init__(self, val=0, next=None):\n        self.val = val\n        self.next = next\nclass Solution:\n    def get_len(self,head:Optional[ListNode])->int:\n        len=0\n        cur=head\n        while cur!=None:\n            len+=1\n            cur=cur.next\n        return len\n\n    def rotateRight(self, head: Optional[ListNode], k: int) -> Optional[ListNode]:\n        if head==None:\n            return None\n        dis=k%self.get_len(head)\n        if dis==0:\n            return head\n        pre=cur=head\n        for i in range(dis):\n            cur=cur.next\n        while cur.next:\n            cur=cur.next\n            pre=pre.next\n\n        rotate_head=pre.next\n        pre.next=None\n        cur.next=head\n        return rotate_head<\/code><\/pre>\n\n\n\n
\u503c\u5f97\u6ce8\u610f\u7684\u662f\uff0c\u7279\u6b8a\u60c5\u51b5\uff0c\u5f53dis==0\uff0c\u4ee5\u53cahead==None\u65f6\uff0c\u90fd\u9700\u8981\u8fdb\u884c\u7279\u6b8a\u5904\u7406\uff0c\u5426\u5219\u7a0b\u5e8f\u4f1a\u62a5\u9519\u3002<\/p>\n\n\n\n
3\uff0c\u76f8\u4ea4\u94fe\u8868<\/h3>\n\n\n\n
\u4f8b\u98983\uff1aleetcode160\uff1a\u76f8\u4ea4\u94fe\u8868<\/a><\/p>\n\n\n\n
\u7ed9\u4f60\u4e24\u4e2a\u5355\u94fe\u8868\u7684\u5934\u8282\u70b9 headA \u548c headB \uff0c\u8bf7\u4f60\u627e\u51fa\u5e76\u8fd4\u56de\u4e24\u4e2a\u5355\u94fe\u8868\u76f8\u4ea4\u7684\u8d77\u59cb\u8282\u70b9\u3002\u5982\u679c\u4e24\u4e2a\u94fe\u8868\u4e0d\u5b58\u5728\u76f8\u4ea4\u8282\u70b9\uff0c\u8fd4\u56de null \u3002<\/p>\n\n\n\n
\u6b64\u9898\u9700\u8981\u914d\u5408\u94fe\u8868\u5faa\u73af\u7684\u7279\u6027\u53bb\u5bfb\u627e\uff0c\u5206\u6790\u5982\u4e0b\uff1a
<\/p>\n\n\n\n
\"\"<\/div><\/figure>\n\n\n\n
\u4eceheadA\u4e0eheadB\u8c01\u5148\u5230\u6700\u540e\u8282\u70b9\uff0c\u5c31\u5c06\u5176\u91cd\u7f6e\u4e3a\u53e6\u4e00\u4e2a\u7684\u5934\u8282\u70b9\uff0c\u8fd9\u6837\uff0c\u5f53\u76f8\u9047\u65f6\u5c31\u4f1a\u521a\u521a\u597d\u5230\u7b2c\u4e00\u4e2a\u516c\u5171\u8282\u70b9\u3002<\/p>\n\n\n\n
from typing import Optional\n# Definition for singly-linked list.\nclass ListNode:\n    def __init__(self, x):\n        self.val = x\n        self.next = None\n\nclass Solution:\n    def getIntersectionNode(self, headA: ListNode, headB: ListNode) -> Optional[ListNode]:\n        if not headA or not headB:\n            return None\n        p1=headA\n        p2=headB\n        while p1!=p2:\n            p1=p1.next if p1 else headB   #\u8fd9\u91cc\u5fc5\u987b\u4f7f\u7528p1,\u800c\u4e0d\u662fp1.next\uff0c\u5426\u5219\u4f1a\u65e0\u9650\u5faa\u73af\n            p2=p2.next if p2 else headA   #\u53ea\u6709\u8fd9\u6837\u5f53\u6ca1\u6709\u4ea4\u70b9\u65f6\uff0c\u624d\u4f1a\u90fd\u6307\u5411null\uff0c\u4ece\u800c\u9000\u51fa\n        return p1\n<\/code><\/pre>\n\n\n\n
4\uff0c\u5408\u5e76\u4e24\u4e2a\u6709\u5e8f\u94fe\u8868<\/h3>\n\n\n\n
\u4f8b\u98984\uff1aleetcode21\uff1a\u5408\u5e76\u4e24\u4e2a\u6709\u5e8f\u94fe\u8868<\/a><\/p>\n\n\n\n
\u5c06\u4e24\u4e2a\u5347\u5e8f\u94fe\u8868\u5408\u5e76\u4e3a\u4e00\u4e2a\u65b0\u7684 \u5347\u5e8f<\/strong> \u94fe\u8868\u5e76\u8fd4\u56de\u3002\u65b0\u94fe\u8868\u662f\u901a\u8fc7\u62fc\u63a5\u7ed9\u5b9a\u7684\u4e24\u4e2a\u94fe\u8868\u7684\u6240\u6709\u8282\u70b9\u7ec4\u6210\u7684\u3002 <\/p>\n\n\n\n
\"\"<\/div><\/figure>\n\n\n\n
\u9996\u5148\uff0c\u6d89\u53ca\u5230\u6784\u5efa\u94fe\u8868\uff0c\u9996\u9009\u865a\u62df\u5934\u8282\u70b9\uff0c\u968f\u540e\uff0c\u91c7\u7528\u53cc\u6307\u9488\u5206\u522b\u904d\u5386\u4e24\u4e2a\u94fe\u8868\u5373\u53ef\u3002<\/p>\n\n\n\n
# Definition for singly-linked list.\nfrom typing import Optional\nclass ListNode:\n    def __init__(self, val=0, next=None):\n        self.val = val\n        self.next = next\nclass Solution:\n    def mergeTwoLists(self, list1: Optional[ListNode], list2: Optional[ListNode]) -> Optional[ListNode]:\n        head=dummy=ListNode()\n        p1=list1\n        p2=list2\n        while p1 and p2:\n            if p1.val<p2.val:\n                dummy.next=p1\n                p1=p1.next\n            else:\n                dummy.next=p2\n                p2=p2.next\n            dummy=dummy.next\n        if p1:\n            dummy.next=p1\n        elif p2:\n            dummy.next=p2\n        return head.next<\/code><\/pre>\n\n\n\n
5,\u6392\u5e8f\u94fe\u8868<\/h3>\n\n\n\n
\u4f8b\u98985\uff1aleetcode148\uff1a\u6392\u5e8f\u94fe\u8868<\/a><\/p>\n\n\n\n
\u7ed9\u4f60\u94fe\u8868\u7684\u5934\u7ed3\u70b9 head \uff0c\u8bf7\u5c06\u5176\u6309 \u5347\u5e8f<\/strong> \u6392\u5217\u5e76\u8fd4\u56de \u6392\u5e8f\u540e\u7684\u94fe\u8868<\/strong> \u3002<\/p>\n\n\n\n
\"\"<\/div><\/figure>\n\n\n\n
\u94fe\u8868\u7684\u6570\u636e\u7ed3\u6784\uff0c\u975e\u5e38\u975e\u5e38\u9002\u5408\u8fdb\u884c\u5f52\u5e76\u6392\u5e8f\uff0c\u9996\u5148\u4f7f\u7528\u4e8c\u5206\u6cd5\uff08\u627e\u4e2d\u70b9\uff09\u6765\u8fdb\u884c\u5207\u5272\uff0c\u968f\u540e\u4f7f\u7528\u5408\u5e76\u4e24\u4e2a\u6709\u5e8f\u94fe\u8868\u7684\u6280\u5de7\u6765\u8fdb\u884cmerge\uff0c\u53ef\u4ee5\u975e\u5e38\u975e\u5e38\u65b9\u4fbf\u5730\u5b9e\u73b0\u5f52\u5e76\u6392\u5e8f\u3002<\/p>\n\n\n\n
from typing import Optional\n# Definition for singly-linked list.\nclass ListNode:\n    def __init__(self, val=0, next=None):\n        self.val = val\n        self.next = next\nclass Solution:\n    def sortList(self, head: Optional[ListNode]) -> Optional[ListNode]:\n        if not head or not head.next:\n            return head\n        slow,fast=head,head.next\n        while fast and fast.next:\n            fast=fast.next.next\n            slow=slow.next\n        mid=slow.next\n        slow.next=None\n        left=self.sortList(head)\n        mid=self.sortList(mid)\n        dummy=new_head=ListNode()\n        while left and mid:\n            if left.val<mid.val:\n                dummy.next=left\n                left=left.next\n            else:\n                dummy.next=mid\n                mid=mid.next\n            dummy=dummy.next\n        dummy.next=left or mid\n        return new_head.next\n\nif __name__ == '__main__':\n    s=Solution()\n    list1=ListNode(1)\n    list1.next=ListNode(2)\n    list1.next.next=ListNode(4)\n    list2=ListNode(1)\n    list2.next=ListNode(3)\n    list2.next.next=ListNode(4)\n    print(s.sortList(list1))\n<\/code><\/pre>\n\n\n\n
\u503c\u5f97\u6ce8\u610f\u7684\u65f6\uff0c\u5f53\u4f7f\u7528\u5f52\u5e76\u6392\u5e8f\u65f6\uff0c\u4e00\u5b9a\u8981\u786e\u4fdd\u4e24\u4e2a\u90e8\u5206\u662f\u65ad\u5f00\u7684\uff0c\u5426\u5219\u4f1a\u51fa\u73b0\u7206\u6808\u7684\u60c5\u51b5\uff0c\u4e00\u5b9a\u8981\u6ce8\u610f\u3002<\/p>\n\n\n\n
6\uff0c\u4e24\u4e24\u4ea4\u6362\u94fe\u8868\u4e2d\u7684\u8282\u70b9<\/h3>\n\n\n\n
\u4f8b\u98986\uff1aleetcode\uff1a24\u4e24\u4e24\u4ea4\u6362\u94fe\u8868\u4e2d\u7684\u8282\u70b9<\/a><\/p>\n\n\n\n
\u7ed9\u4f60\u4e00\u4e2a\u94fe\u8868\uff0c\u4e24\u4e24\u4ea4\u6362\u5176\u4e2d\u76f8\u90bb\u7684\u8282\u70b9\uff0c\u5e76\u8fd4\u56de\u4ea4\u6362\u540e\u94fe\u8868\u7684\u5934\u8282\u70b9\u3002\u4f60\u5fc5\u987b\u5728\u4e0d\u4fee\u6539\u8282\u70b9\u5185\u90e8\u7684\u503c\u7684\u60c5\u51b5\u4e0b\u5b8c\u6210\u672c\u9898\uff08\u5373\uff0c\u53ea\u80fd\u8fdb\u884c\u8282\u70b9\u4ea4\u6362\uff09\u3002<\/p>\n\n\n\n
\"\"<\/div><\/figure>\n\n\n\n
\u8fd9\u79cd\u9898\u76ee\u5c31\u662f\u7eaf\u7cb9\u7684\u94fe\u8868\u53cc\u6307\u9488\u64cd\u4f5c\uff0c\u5355\u4e2a\u5faa\u73af\u6d41\u7a0b\u5373\u4e3a\u5148\u5c062\u6307\u54111\uff0c\u968f\u540e1\u6307\u54113\uff0c\u66f4\u65b0\u6307\u94881\u7684\u4e3a3\uff0c\u6307\u94882\u7684\u4e3a4\uff0c\u4e00\u76f4\u91cd\u590d\u503c\u6307\u94881\u6307\u5411\u7a7a\u4e3a\u6b62\u3002<\/p>\n\n\n\n
from typing import Optional\n# Definition for singly-linked list.\nclass ListNode:\n    def __init__(self, val=0, next=None):\n        self.val = val\n        self.next = next\n\n\nclass Solution:\n    def swapPairs(self, head: Optional[ListNode]) -> Optional[ListNode]:\n        if head is None or head.next is None:\n            return head\n        dummy=ListNode(0)  #\u865a\u62df\u5934\u8282\u70b9\u907f\u514d\u5206\u7c7b\u8ba8\u8bba\n        dummy.next=head\n        pre=dummy\n        while head and head.next:\n            first=head  #\u7b2c\u4e00\u4e2a\u8282\u70b9\n            second=head.next  #\u7b2c\u4e8c\u4e2a\u8282\u70b9\n            pre.next=second  #\u524d\u4e00\u4e2a\u8282\u70b9\u7684next\u6307\u5411\u7b2c\u4e8c\u4e2a\u8282\u70b9\n            first.next=second.next  #\u7b2c\u4e00\u4e2a\u8282\u70b9\u7684next\u6307\u5411\u7b2c\u4e8c\u4e2a\u8282\u70b9\u7684next\n            second.next=first  #\u7b2c\u4e8c\u4e2a\u8282\u70b9\u7684next\u6307\u5411\u7b2c\u4e00\u4e2a\u8282\u70b9\n            pre=first  #\u524d\u4e00\u4e2a\u8282\u70b9\u6307\u5411\u7b2c\u4e00\u4e2a\u8282\u70b9\n            head=first.next  #\u5934\u8282\u70b9\u6307\u5411\u7b2c\u4e00\u4e2a\u8282\u70b9\u7684next\n\n        return dummy.next<\/code><\/pre>\n\n\n\n
\u8fd9\u9053\u9898\u7684\u5173\u952e\u662f\u521b\u5efa\u4e00\u4e2a\u865a\u62df\u5934\u8282\u70b9\u53bb\u5b58\u50a8\u524d\u4e00\u4e2a\u8282\u70b9\uff0c\u4ee5\u4fbf\u540e\u7eed\u94fe\u63a5\uff0c\u5426\u5219\u4f1a\u51fa\u73b0\u94fe\u63a5\u6df7\u4e71\u3002<\/p>\n\n\n\n
\u4e09\u3001\u94fe\u8868\u7efc\u5408\u64cd\u4f5c<\/h3>\n\n\n\n
\u8fd9\u90e8\u5206\u7684\u9898\u578b\u5e38\u5e38\u7528\u5230\u524d\u9762\u8fd9\u4e9b\u57fa\u7840\u9898\u7684\u64cd\u4f5c\u76f8\u6df7\u5408\uff0c\u60f3\u8981\u5199\u597d\u8fd9\u7c7b\u9898\u578b\u5fc5\u987b\u6709\u5341\u5206\u624e\u5b9e\u7684\u57fa\u7840\u3002<\/p>\n\n\n\n
1,\u91cd\u6392\u94fe\u8868<\/h3>\n\n\n\n
\u4f8b\u98981\uff1aleetcode143\uff1a\u91cd\u6392\u94fe\u8868<\/a><\/p>\n\n\n\n
\"\"<\/div><\/figure>\n\n\n\n
\"\"<\/div><\/figure>\n\n\n\n
\u6b64\u9898\u7efc\u5408\u4e86\u627e\u4e2d\u70b9\u3001\u7ffb\u8f6c\u94fe\u8868\u3001\u5408\u5e76\u4e24\u4e2a\u94fe\u8868\u3001\u865a\u62df\u5934\u8282\u70b9\u8fd9\u56db\u4e2a\u64cd\u4f5c\uff0c\u7efc\u5408\u6027\u8d28\u5341\u8db3\u3002<\/p>\n\n\n\n
from typing import Optional\n# Definition for singly-linked list.\nclass ListNode:\n    def __init__(self, val=0, next=None):\n        self.val = val\n        self.next = next\nclass Solution:\n    def reverse_list(self,head):\n        pre=None\n        cur=head\n        while cur:\n            temp=cur.next\n            cur.next=pre\n            pre=cur\n            cur=temp\n        return pre\n    def find_mid(self,head):\n        \"\"\"\n        \u5f97\u5230\u504f\u5de6\u7684\u8282\u70b9\uff0c\u65b9\u4fbf\u65ad\u5f00\u4e24\u6bb5\u94fe\u8868\n        :param head:\n        :return:\n        \"\"\"\n        if not head:\n            return head\n        fast=head.next\n        slow=head\n        while fast and fast.next:\n            slow=slow.next\n            fast=fast.next.next\n        return slow\n\n    def reorderList(self, head: Optional[ListNode]) -> None:\n        if not head or not head.next:\n            return head\n        pre_mid=self.find_mid(head)\n        mid=pre_mid.next\n        pre_mid.next=None #\u65ad\u5f00\u94fe\u8868\n\n        second_list=self.reverse_list(mid)\n        first_list=head\n\n        new_head=dummy_head=ListNode()   #\u865a\u62df\u5934\u8282\u70b9\uff0c\u4ee5\u7b80\u5316\u5408\u5e76\u903b\u8f91\n\n        while second_list and first_list:\n            dummy_head.next=first_list\n            dummy_head=dummy_head.next\n            first_list=first_list.next\n\n            dummy_head.next=second_list                          \n            dummy_head=dummy_head.next\n            second_list=second_list.next                             #\u5904\u7406\u5269\u4f59\u8282\u70b9\uff0c\u5b9e\u9645\u53ea\u6709\u53ef\u80fd\u524d\u4e00\u6bb5\u5269\u4f59\uff0c\n        dummy_head.next=second_list if second_list else first_list   # \u4f46\u662f\u4e3a\u4e86\u5c11\u52a8\u70b9\u8111\u5b50\u5c31\u8fd9\u6837\u5427\n\n        return new_head.next\n<\/code><\/pre>\n\n\n\n
2\uff0c\u4e24\u6570\u76f8\u52a0<\/h3>\n\n\n\n
\u4f8b\u98982\uff1aleetcode445\uff1a\u4e24\u6570\u76f8\u52a0\u2161<\/a><\/p>\n\n\n\n
\u7ed9\u4f60\u4e24\u4e2a\u00a0\u975e\u7a7a<\/strong>\u00a0\u94fe\u8868\u6765\u4ee3\u8868\u4e24\u4e2a\u975e\u8d1f\u6574\u6570\u3002\u6570\u5b57\u6700\u9ad8\u4f4d\u4f4d\u4e8e\u94fe\u8868\u5f00\u59cb\u4f4d\u7f6e\u3002\u5b83\u4eec\u7684\u6bcf\u4e2a\u8282\u70b9\u53ea\u5b58\u50a8\u4e00\u4f4d\u6570\u5b57\u3002\u5c06\u8fd9\u4e24\u6570\u76f8\u52a0\u4f1a\u8fd4\u56de\u4e00\u4e2a\u65b0\u7684\u94fe\u8868\u3002<\/p>\n\n\n\n
\u4f60\u53ef\u4ee5\u5047\u8bbe\u9664\u4e86\u6570\u5b57 0 \u4e4b\u5916\uff0c\u8fd9\u4e24\u4e2a\u6570\u5b57\u90fd\u4e0d\u4f1a\u4ee5\u96f6\u5f00\u5934\u3002<\/p>\n\n\n\n
\"\"<\/div><\/figure>\n\n\n\n
\u672c\u9898\u7efc\u5408\u4e86\u94fe\u8868\u7ffb\u8f6c\u4ee5\u53ca\u94fe\u8868\u52a0\u548c\u8fd9\u4e24\u4e2a\u64cd\u4f5c\u3001\u5173\u4e8e\u94fe\u8868\u52a0\u548c\uff0c\u5fc5\u987b\u662f\u5012\u5e8f\u7684\u5404\u4e2a\u6570\u5b57\u624d\u80fd\u6a21\u62df\u76f8\u52a0\u7684\u8fc7\u7a0b\u3002<\/p>\n\n\n\n
# Definition for singly-linked list.\nfrom typing import Optional\nclass ListNode:\n    def __init__(self, val=0, next=None):\n        self.val = val\n        self.next = next\nclass Solution:\n    def reverse_list(self,head: Optional[ListNode]) -> Optional[ListNode]:\n        pre=None\n        cur=head\n        while cur:\n            temp=cur.next\n            cur.next=pre\n            pre=cur\n            cur=temp\n        return pre\n    def addTwoNumbers(self, l1: Optional[ListNode], l2: Optional[ListNode]) -> Optional[ListNode]:\n        list1_head=self.reverse_list(l1)\n        list2_head=self.reverse_list(l2)\n        carry=0\n        res=new_head=ListNode(0)\n        while list1_head or list2_head or carry:       #\u6ce8\u610f\uff0c\u6b64\u5904\u8fb9\u754c\u5224\u65ad\u53ef\u4ee5\u8bf4\u662f\u4e24\u6570\u76f8\u52a0\u7684\u7cbe\u9ad3\n            num1=list1_head.val if list1_head else 0   #\u4f7f\u7528\u8be5\u8fb9\u754c\u6761\u4ef6\u5224\u65ad\u53ef\u4ee5\u907f\u514d\u51e0\u4e4e\u6240\u6709\u7684\u5206\u7c7b\u8ba8\u8bba\n            num2=list2_head.val if list2_head else 0\n            total=num1+num2+carry\n            carry=total\/\/10                            #\u6ce8\u610f\u6b64\u5904\u9700\u8981\u6574\u9664\uff0c\u5426\u5219\u4f1a\u51fa\u73b0\u5c0f\u6570\n            num=total%10\n            new_head.next=ListNode(num)\n            new_head=new_head.next\n\n            if list1_head:\n                list1_head=list1_head.next\n            if list2_head:\n                list2_head=list2_head.next\n\n        return self.reverse_list(res.next)\n<\/code><\/pre>\n\n\n\n
3\uff0c\u6709\u73af\u94fe\u8868<\/h3>\n\n\n\n
\u4f8b\u98983\uff1aleetcode141\uff1a\u73af\u5f62\u94fe\u8868<\/a><\/p>\n\n\n\n
\u7ed9\u4f60\u4e00\u4e2a\u94fe\u8868\u7684\u5934\u8282\u70b9\u00a0head\u00a0\uff0c\u5224\u65ad\u94fe\u8868\u4e2d\u662f\u5426\u6709\u73af\u3002<\/p>\n\n\n\n
\u5982\u679c\u94fe\u8868\u4e2d\u6709\u67d0\u4e2a\u8282\u70b9\uff0c\u53ef\u4ee5\u901a\u8fc7\u8fde\u7eed\u8ddf\u8e2a\u00a0next\u00a0\u6307\u9488\u518d\u6b21\u5230\u8fbe\uff0c\u5219\u94fe\u8868\u4e2d\u5b58\u5728\u73af\u3002 \u4e3a\u4e86\u8868\u793a\u7ed9\u5b9a\u94fe\u8868\u4e2d\u7684\u73af\uff0c\u8bc4\u6d4b\u7cfb\u7edf\u5185\u90e8\u4f7f\u7528\u6574\u6570\u00a0pos\u00a0\u6765\u8868\u793a\u94fe\u8868\u5c3e\u8fde\u63a5\u5230\u94fe\u8868\u4e2d\u7684\u4f4d\u7f6e\uff08\u7d22\u5f15\u4ece 0 \u5f00\u59cb\uff09\u3002\u6ce8\u610f\uff1apos\u00a0\u4e0d\u4f5c\u4e3a\u53c2\u6570\u8fdb\u884c\u4f20\u9012\u00a0<\/strong>\u3002\u4ec5\u4ec5\u662f\u4e3a\u4e86\u6807\u8bc6\u94fe\u8868\u7684\u5b9e\u9645\u60c5\u51b5\u3002<\/p>\n\n\n\n
\u5982\u679c\u94fe\u8868\u4e2d\u5b58\u5728\u73af<\/em>\u00a0\uff0c\u5219\u8fd4\u56de\u00a0true\u00a0\u3002 \u5426\u5219\uff0c\u8fd4\u56de\u00a0false\u00a0\u3002<\/p>\n\n\n\n
# Definition for singly-linked list.\n# class ListNode:\n#     def __init__(self, x):\n#         self.val = x\n#         self.next = None\n\nclass Solution:\n    def hasCycle(self, head: Optional[ListNode]) -> bool:\n        if not head:\n            return False\n        slow=head\n        fast=head\n        while fast and fast.next:\n            slow=slow.next\n            fast=fast.next.next\n            if slow==fast:\n                return True\n        return False\n<\/code><\/pre>\n\n\n\n
\u4e0a\u8ff0\u53ea\u662f\u57fa\u672c\u64cd\u4f5c\uff0c\u5373\u5229\u7528\u5feb\u6162\u6307\u9488\uff0c\u5982\u679c\u94fe\u8868\u6709\u73af\u90a3\u4e48\u4e24\u4e2a\u6307\u9488\u662f\u4e00\u5b9a\u4f1a\u76f8\u9047\u7684\u3002\u63a5\u4e0b\u6765\u624d\u662f\u91cd\u5934\u620f\u3002<\/p>\n\n\n\n
\u4f8b\u98984\uff1aleetcode142\uff1a\u73af\u5f62\u94fe\u8868\u2161<\/a><\/p>\n\n\n\n
\u7ed9\u5b9a\u4e00\u4e2a\u94fe\u8868\u7684\u5934\u8282\u70b9 \u00a0head\u00a0\uff0c\u8fd4\u56de\u94fe\u8868\u5f00\u59cb\u5165\u73af\u7684\u7b2c\u4e00\u4e2a\u8282\u70b9\u3002\u00a0\u5982\u679c\u94fe\u8868\u65e0\u73af\uff0c\u5219\u8fd4\u56de\u00a0null\u3002<\/p>\n\n\n\n
\u5982\u679c\u94fe\u8868\u4e2d\u6709\u67d0\u4e2a\u8282\u70b9\uff0c\u53ef\u4ee5\u901a\u8fc7\u8fde\u7eed\u8ddf\u8e2a\u00a0next\u00a0\u6307\u9488\u518d\u6b21\u5230\u8fbe\uff0c\u5219\u94fe\u8868\u4e2d\u5b58\u5728\u73af\u3002 \u4e3a\u4e86\u8868\u793a\u7ed9\u5b9a\u94fe\u8868\u4e2d\u7684\u73af\uff0c\u8bc4\u6d4b\u7cfb\u7edf\u5185\u90e8\u4f7f\u7528\u6574\u6570\u00a0pos\u00a0\u6765\u8868\u793a\u94fe\u8868\u5c3e\u8fde\u63a5\u5230\u94fe\u8868\u4e2d\u7684\u4f4d\u7f6e\uff08\u7d22\u5f15\u4ece 0 \u5f00\u59cb\uff09<\/strong>\u3002\u5982\u679c\u00a0pos\u00a0\u662f\u00a0-1<\/code>\uff0c\u5219\u5728\u8be5\u94fe\u8868\u4e2d\u6ca1\u6709\u73af\u3002\u6ce8\u610f\uff1apos<\/code>\u00a0\u4e0d\u4f5c\u4e3a\u53c2\u6570\u8fdb\u884c\u4f20\u9012<\/strong>\uff0c\u4ec5\u4ec5\u662f\u4e3a\u4e86\u6807\u8bc6\u94fe\u8868\u7684\u5b9e\u9645\u60c5\u51b5\u3002<\/p>\n\n\n\n
\u4e0d\u5141\u8bb8\u4fee\u6539\u00a0<\/strong>\u94fe\u8868\u3002
<\/p>\n\n\n\n
\"\"<\/div><\/figure>\n\n\n\n
class Solution(object):\n    def detectCycle(self, head):\n        fast, slow = head, head\n        while True:\n            if not (fast and fast.next): return\n            fast, slow = fast.next.next, slow.next\n            if fast == slow: break\n        fast = head\n        while fast != slow:\n            fast, slow = fast.next, slow.next\n        return fast\n<\/code><\/pre>\n\n\n\n
<\/p>\n","protected":false},"excerpt":{"rendered":"
\u6700\u8fd1\u901a\u8fc7leetcode\u5237\u9898\u590d\u4e60\u94fe\u8868\u76f8\u5173\u7684\u77e5\u8bc6\uff0c\u5c06\u5176\u5212\u5206\u4e3a\u4e09\u5927\u90e8\u5206\uff0c\u5206\u522b\u662f\u94fe\u8868\u57fa\u7840\u64cd\u4f5c\u3001\u8fdb\u9636\u6280\u5de7\u3001\u7efc\u5408\u9898\u578b\u3002  […]<\/p>\n","protected":false},"author":1,"featured_media":97,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[1],"tags":[],"class_list":["post-98","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-learning"],"_links":{"self":[{"href":"https:\/\/yxzhangcoco.xyz\/index.php\/wp-json\/wp\/v2\/posts\/98","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/yxzhangcoco.xyz\/index.php\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/yxzhangcoco.xyz\/index.php\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/yxzhangcoco.xyz\/index.php\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/yxzhangcoco.xyz\/index.php\/wp-json\/wp\/v2\/comments?post=98"}],"version-history":[{"count":6,"href":"https:\/\/yxzhangcoco.xyz\/index.php\/wp-json\/wp\/v2\/posts\/98\/revisions"}],"predecessor-version":[{"id":114,"href":"https:\/\/yxzhangcoco.xyz\/index.php\/wp-json\/wp\/v2\/posts\/98\/revisions\/114"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/yxzhangcoco.xyz\/index.php\/wp-json\/wp\/v2\/media\/97"}],"wp:attachment":[{"href":"https:\/\/yxzhangcoco.xyz\/index.php\/wp-json\/wp\/v2\/media?parent=98"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/yxzhangcoco.xyz\/index.php\/wp-json\/wp\/v2\/categories?post=98"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/yxzhangcoco.xyz\/index.php\/wp-json\/wp\/v2\/tags?post=98"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}