{"id":6513,"date":"2018-03-16T20:38:39","date_gmt":"2018-03-16T12:38:39","guid":{"rendered":"https:\/\/kyle.ai\/blog\/?p=6513"},"modified":"2018-03-29T16:15:18","modified_gmt":"2018-03-29T08:15:18","slug":"%e9%93%be%e8%a1%a8%e7%9b%b8%e5%85%b3%e7%ae%97%e6%b3%95%e9%97%ae%e9%a2%98%e9%9b%86%e9%94%a6","status":"publish","type":"post","link":"https:\/\/kyle.ai\/blog\/6513.html","title":{"rendered":"\u94fe\u8868\u76f8\u5173\u7b97\u6cd5\u95ee\u9898\u96c6\u9526"},"content":{"rendered":"

\u672c\u6587\u7528\u5230\u7684\u94fe\u8868python\u5b9e\u73b0\u7c7b\u5982\u4e0b\uff1a<\/p>\n

\r\nclass ListNode(object):\r\n\r\n    def __init__(self, val):\r\n        self.val = val\r\n        self.next = None\r\n\r\n    @staticmethod\r\n    def fromlist(arr):\r\n        dummy = ListNode(-1)\r\n        head = ListNode(arr.pop(0))\r\n        dummy.next = head\r\n        while arr:\r\n            head.next = ListNode(arr.pop(0))\r\n            head = head.next\r\n        return dummy.next\r\n\r\n    def tolist(self):\r\n        ret = [self.val]\r\n        node = self.next\r\n        while node:\r\n            ret.append(node.val)\r\n            node = node.next\r\n        return ret\r\n\r\n    def __getitem__(self, item):\r\n        if not isinstance(item, int):\r\n            return None\r\n        ret, i = self, 0\r\n        while ret:\r\n            if i == item:\r\n                return ret\r\n            ret = ret.next\r\n            i += 1\r\n        return None\r\n<\/pre>\n
\u5728O(1)\u65f6\u95f4\u5220\u9664\u94fe\u8868\u8282\u70b9<\/h1>\n
\u9898\u76ee\u63cf\u8ff0\uff1a\u7ed9\u5b9a\u94fe\u8868\u7684\u5934\u6307\u9488\u548c\u4e00\u4e2a\u8282\u70b9\u6307\u9488\uff0c\u5728O(1)\u65f6\u95f4\u5220\u9664\u8be5\u8282\u70b9\u3002[Google\u9762\u8bd5\u9898]<\/p>\n
\u5206\u6790\uff1a\u672c\u9898\u4e0e\u300a\u7f16\u7a0b\u4e4b\u7f8e\u300b\u4e0a\u7684\u300c\u4ece\u65e0\u5934\u5355\u94fe\u8868\u4e2d\u5220\u9664\u8282\u70b9\u300d\u7c7b\u4f3c\u3002\u4e3b\u8981\u601d\u60f3\u90fd\u662f\u300c\u72f8\u732b\u6362\u592a\u5b50\u300d\uff0c\u5373\u7528\u4e0b\u4e00\u4e2a\u8282\u70b9\u6570\u636e\u8986\u76d6\u8981\u5220\u9664\u7684\u8282\u70b9\uff0c\u7136\u540e\u5220\u9664\u4e0b\u4e00\u4e2a\u8282\u70b9\u3002\u4f46\u662f\u5982\u679c\u8282\u70b9\u662f\u5c3e\u8282\u70b9\u65f6\uff0c\u8be5\u65b9\u6cd5\u5c31\u884c\u4e0d\u901a\u4e86\u3002<\/p>\n
\u4ee3\u7801\u5982\u4e0b\uff1a<\/p>\n
\r\ndef delete_node(node):\r\n    if not node or not node.next:\r\n        return\r\n    node.val = node.next.val\r\n    node.next = node.next.next\r\n\r\nhead = ListNode.fromlist([1,2,3,4,5])\r\ndelete_node(head[2])\r\nassert head.tolist() == [1,2,4,5]\r\n<\/pre>\n
\u5355\u94fe\u8868\u7684\u8f6c\u7f6e<\/h1>\n
\u9898\u76ee\u63cf\u8ff0\uff1a\u8f93\u5165\u4e00\u4e2a\u5355\u5411\u94fe\u8868\uff0c\u8f93\u51fa\u9006\u5e8f\u53cd\u8f6c\u540e\u7684\u94fe\u8868<\/p>\n
\u5206\u6790\uff1a\u94fe\u8868\u7684\u8f6c\u7f6e\u662f\u4e00\u4e2a\u5f88\u5e38\u89c1\u3001\u5f88\u57fa\u7840\u7684\u6570\u636e\u7ed3\u6784\u9898\u4e86\uff0c\u975e\u9012\u5f52\u7684\u7b97\u6cd5\u5f88\u7b80\u5355\uff0c\u7528\u4e09\u4e2a\u4e34\u65f6\u6307\u9488 pre\u3001head\u3001next \u5728\u94fe\u8868\u4e0a\u5faa\u73af\u4e00\u904d\u5373\u53ef\u3002\u9012\u5f52\u7b97\u6cd5\u4e5f\u662f\u6bd4\u8f83\u7b80\u5355\u7684\uff0c\u4f46\u662f\u5982\u679c\u601d\u8def\u4e0d\u6e05\u6670\u4f30\u8ba1\u4e00\u65f6\u534a\u4f1a\u513f\u4e5f\u5199\u4e0d\u51fa\u6765\u5427\u3002<\/p>\n
\u4e0b\u9762\u662f\u5faa\u73af\u7248\u672c\u548c\u9012\u5f52\u7248\u672c\u7684\u94fe\u8868\u8f6c\u7f6e\u4ee3\u7801\uff1a<\/p>\n
\r\ndef reverse(head):\r\n    p1 = head\r\n    p2 = head.next\r\n    while p2:\r\n        tmp = p2.next\r\n        p2.next = p1\r\n        p1 = p2\r\n        p2 = tmp\r\n    head.next = None\r\n    return p1\r\n\r\nhead = ListNode.fromlist([1,2,3,4,5])\r\nreversed_head = reverse(head)\r\nassert reversed_head.tolist() == [5,4,3,2,1]\r\n\r\ndef reverse(head):\r\n    if head==None or head.next==None:\r\n        return head\r\n    new_head = reverse(head.next)\r\n    head.next.next = head\r\n    head.next = None\r\n    return new_head\r\n\r\nhead = ListNode.fromlist([1,2,3,4,5])\r\nreversed_head = reverse(head)\r\nassert reversed_head.tolist() == [5,4,3,2,1]\r\n<\/pre>\n
\u6c42\u94fe\u8868\u5012\u6570\u7b2ck\u4e2a\u8282\u70b9<\/h1>\n
\u9898\u76ee\u63cf\u8ff0\uff1a\u8f93\u5165\u4e00\u4e2a\u5355\u5411\u94fe\u8868\uff0c\u8f93\u51fa\u8be5\u94fe\u8868\u4e2d\u5012\u6570\u7b2ck\u4e2a\u8282\u70b9\uff0c\u94fe\u8868\u7684\u5012\u6570\u7b2c0\u4e2a\u8282\u70b9\u4e3a\u94fe\u8868\u7684\u5c3e\u6307\u9488\u3002<\/p>\n
\u5206\u6790\uff1a\u8bbe\u7f6e\u4e24\u4e2a\u6307\u9488 p1\u3001p2\uff0c\u9996\u5148 p1 \u548c p2 \u90fd\u6307\u5411 head\uff0c\u7136\u540e p2 \u5411\u524d\u8d70 k \u6b65\uff0c\u8fd9\u6837 p1 \u548c p2 \u4e4b\u95f4\u5c31\u95f4\u9694 k \u4e2a\u8282\u70b9\uff0c\u6700\u540e p1 \u548c p2 \u540c\u65f6\u5411\u524d\u79fb\u52a8\uff0c\u76f4\u81f3 p2 \u8d70\u5230\u94fe\u8868\u672b\u5c3e\u3002<\/p>\n
\u4ee3\u7801\u5982\u4e0b\uff1a<\/p>\n
\r\ndef last_k_nodes(head, k):\r\n    if k<0: return None slow,fast = head,head while k>0 and fast.next:\r\n        fast = fast.next\r\n        k -= 1\r\n    if k>0:\r\n        return None\r\n    while fast and fast.next:\r\n        fast = fast.next\r\n        slow = slow.next\r\n    return slow\r\n\r\nhead = ListNode.fromlist([1,2,3,4,5])\r\nassert last_k_nodes(head, 0).val == 5\r\nassert last_k_nodes(head, 1).val == 4\r\nassert last_k_nodes(head, 4).val == 1\r\nassert last_k_nodes(head, 5) is None\r\n<\/pre>\n
\u7c7b\u4f3c\u7684\u9898\u76ee\u6709\uff0c\u5220\u9664\u94fe\u8868\u5012\u6570\u7684\u7b2cK\u4e2a\u8282\u70b9\u3002<\/p>\n
\u6c42\u94fe\u8868\u7684\u4e2d\u95f4\u8282\u70b9<\/h1>\n
\u9898\u76ee\u63cf\u8ff0\uff1a\u6c42\u94fe\u8868\u7684\u4e2d\u95f4\u8282\u70b9\uff0c\u5982\u679c\u94fe\u8868\u7684\u957f\u5ea6\u4e3a\u5076\u6570\uff0c\u8fd4\u56de\u4e2d\u95f4\u4e24\u4e2a\u8282\u70b9\u7684\u4efb\u610f\u4e00\u4e2a\uff0c\u82e5\u4e3a\u5947\u6570\uff0c\u5219\u8fd4\u56de\u4e2d\u95f4\u8282\u70b9\u3002<\/p>\n
\u5206\u6790\uff1a\u6b64\u9898\u7684\u89e3\u51b3\u601d\u8def\u548c\u7b2c3\u9898\u300c\u6c42\u94fe\u8868\u7684\u5012\u6570\u7b2c k \u4e2a\u8282\u70b9\u300d\u5f88\u76f8\u4f3c\u3002\u53ef\u4ee5\u5148\u6c42\u94fe\u8868\u7684\u957f\u5ea6\uff0c\u7136\u540e\u8ba1\u7b97\u51fa\u4e2d\u95f4\u8282\u70b9\u6240\u5728\u94fe\u8868\u987a\u5e8f\u7684\u4f4d\u7f6e\u3002\u4f46\u662f\u5982\u679c\u8981\u6c42\u53ea\u80fd\u626b\u63cf\u4e00\u904d\u94fe\u8868\uff0c\u5982\u4f55\u89e3\u51b3\u5462\uff1f\u6700\u9ad8\u6548\u7684\u89e3\u6cd5\u548c\u7b2c3\u9898\u4e00\u6837\uff0c\u901a\u8fc7\u4e24\u4e2a\u6307\u9488\u6765\u5b8c\u6210\u3002\u7528\u4e24\u4e2a\u6307\u9488\u4ece\u94fe\u8868\u5934\u8282\u70b9\u5f00\u59cb\uff0c\u4e00\u4e2a\u6307\u9488\u6bcf\u6b21\u5411\u540e\u79fb\u52a8\u4e24\u6b65\uff0c\u4e00\u4e2a\u6bcf\u6b21\u79fb\u52a8\u4e00\u6b65\uff0c\u76f4\u5230\u5feb\u6307\u9488\u79fb\u5230\u5230\u5c3e\u8282\u70b9\uff0c\u90a3\u4e48\u6162\u6307\u9488\u5373\u662f\u6240\u6c42\u3002<\/p>\n
\r\ndef find_middle(head):\r\n    slow, fast = head, head\r\n    while fast and fast.next:\r\n        fast = fast.next.next\r\n        slow = slow.next\r\n    return slow\r\n\r\nhead = ListNode.fromlist([1,2,3,4,5])\r\nassert find_middle(head).val == 3\r\nhead = ListNode.fromlist([1,2,3,4,5,6])\r\nassert find_middle(head).val in [3,4]\r\n<\/pre>\n
\u5224\u65ad\u5355\u94fe\u8868\u662f\u5426\u5b58\u5728\u73af<\/h1>\n
\u9898\u76ee\u63cf\u8ff0\uff1a\u8f93\u5165\u4e00\u4e2a\u5355\u5411\u94fe\u8868\uff0c\u5224\u65ad\u94fe\u8868\u662f\u5426\u6709\u73af\uff1f<\/p>\n
\u5206\u6790\uff1a\u901a\u8fc7\u4e24\u4e2a\u6307\u9488\uff0c\u5206\u522b\u4ece\u94fe\u8868\u7684\u5934\u8282\u70b9\u51fa\u53d1\uff0c\u4e00\u4e2a\u6bcf\u6b21\u5411\u540e\u79fb\u52a8\u4e00\u6b65\uff0c\u53e6\u4e00\u4e2a\u79fb\u52a8\u4e24\u6b65\uff0c\u4e24\u4e2a\u6307\u9488\u79fb\u52a8\u901f\u5ea6\u4e0d\u4e00\u6837\uff0c\u5982\u679c\u5b58\u5728\u73af\uff0c\u90a3\u4e48\u4e24\u4e2a\u6307\u9488\u4e00\u5b9a\u4f1a\u5728\u73af\u91cc\u76f8\u9047\u3002<\/p>\n
\u4ee3\u7801\u5982\u4e0b\uff1a<\/p>\n
\r\ndef is_circle(head):\r\n    slow, fast = head, head\r\n    while fast and fast.next:\r\n        fast = fast.next.next\r\n        slow = slow.next\r\n        if fast is slow:\r\n            return True\r\n    return False\r\n\r\nhead = ListNode.fromlist([1,2,3,4,5])\r\nassert is_circle(head) == False\r\n\r\ncircle_head = ListNode.fromlist([1,2,3])\r\ncircle = ListNode(0)\r\ncircle_head.next.next.next = circle\r\ndummy = circle\r\nfor i in range(4, 7):\r\n    circle.next = ListNode(i)\r\n    circle = circle.next\r\ncircle.next = dummy\r\nassert is_circle(circle_head) == True\r\n<\/pre>\n
\u627e\u5230\u73af\u7684\u5165\u53e3\u70b9<\/h1>\n
\u9898\u76ee\u63cf\u8ff0\uff1a\u8f93\u5165\u4e00\u4e2a\u5355\u5411\u94fe\u8868\uff0c\u5224\u65ad\u94fe\u8868\u662f\u5426\u6709\u73af\u3002\u5982\u679c\u94fe\u8868\u5b58\u5728\u73af\uff0c\u5982\u4f55\u627e\u5230\u73af\u7684\u5165\u53e3\u70b9\uff1f<\/p>\n
\u89e3\u9898\u601d\u8def\uff1a \u7531\u4e0a\u9898\u53ef\u77e5\uff0c\u6309\u7167 p2 \u6bcf\u6b21\u4e24\u6b65\uff0cp1 \u6bcf\u6b21\u4e00\u6b65\u7684\u65b9\u5f0f\u8d70\uff0c\u53d1\u73b0 p2 \u548c p1 \u91cd\u5408\uff0c\u786e\u5b9a\u4e86\u5355\u5411\u94fe\u8868\u6709\u73af\u8def\u4e86\u3002\u63a5\u4e0b\u6765\uff0c\u8ba9p2\u56de\u5230\u94fe\u8868\u7684\u5934\u90e8\uff0c\u91cd\u65b0\u8d70\uff0c\u6bcf\u6b21\u6b65\u957f\u4e0d\u662f\u8d702\u4e86\uff0c\u800c\u662f\u8d701\uff0c\u90a3\u4e48\u5f53 p1 \u548c p2 \u518d\u6b21\u76f8\u9047\u7684\u65f6\u5019\uff0c\u5c31\u662f\u73af\u8def\u7684\u5165\u53e3\u4e86\u3002<\/p>\n
\u4e3a\u4ec0\u4e48\uff1f\uff1a\u5047\u5b9a\u8d77\u70b9\u5230\u73af\u5165\u53e3\u70b9\u7684\u8ddd\u79bb\u4e3a a\uff0cp1 \u548c p2 \u7684\u76f8\u4ea4\u70b9M\u4e0e\u73af\u5165\u53e3\u70b9\u7684\u8ddd\u79bb\u4e3ab\uff0c\u73af\u8def\u7684\u5468\u957f\u4e3aL\uff0c\u5f53 p1 \u548c p2 \u7b2c\u4e00\u6b21\u76f8\u9047\u7684\u65f6\u5019\uff0c\u5047\u5b9a p1 \u8d70\u4e86 n \u6b65\u3002\u90a3\u4e48\u6709\uff1a<\/p>\n
p1\u8d70\u7684\u8def\u5f84\uff1a a+b \uff1d n\uff1b
\np2\u8d70\u7684\u8def\u5f84\uff1a a+b+k*L = 2*n\uff1b p2 \u6bd4 p1 \u591a\u8d70\u4e86k\u5708\u73af\u8def\uff0c\u603b\u8def\u7a0b\u662fp1\u76842\u500d<\/p>\n
\u6839\u636e\u4e0a\u8ff0\u516c\u5f0f\u53ef\u4ee5\u5f97\u5230 k*L=a+b=n\u663e\u7136\uff0c\u5982\u679c\u4ece\u76f8\u9047\u70b9M\u5f00\u59cb\uff0cp1 \u518d\u8d70 n \u6b65\u7684\u8bdd\uff0c\u8fd8\u53ef\u4ee5\u518d\u56de\u5230\u76f8\u9047\u70b9\uff0c\u540c\u65f6p2\u4ece\u5934\u5f00\u59cb\u8d70\u7684\u8bdd\uff0c\u7ecf\u8fc7n\u6b65\uff0c\u4e5f\u4f1a\u8fbe\u5230\u76f8\u9047\u70b9M\u3002<\/p>\n
\u663e\u7136\u5728\u8fd9\u4e2a\u6b65\u9aa4\u5f53\u4e2d p1 \u548c p2 \u53ea\u6709\u524d a \u6b65\u8d70\u7684\u8def\u5f84\u4e0d\u540c\uff0c\u6240\u4ee5\u5f53 p1 \u548c p2 \u518d\u6b21\u91cd\u5408\u7684\u65f6\u5019\uff0c\u5fc5\u7136\u662f\u5728\u94fe\u8868\u7684\u73af\u8def\u5165\u53e3\u70b9\u4e0a\u3002<\/p>\n
\u4ee3\u7801\u5982\u4e0b\uff1a<\/p>\n
\r\ndef find_loop_idx(head):\r\n    if not head or not head.next: return None\r\n    slow, fast = head, head\r\n    while fast and fast.next:\r\n        fast = fast.next.next\r\n        slow = slow.next\r\n        if fast is slow:\r\n            break\r\n    if fast is not slow: # circle dont exists\r\n        return None\r\n    fast = head\r\n    while fast and fast.next:\r\n        fast = fast.next\r\n        slow = slow.next\r\n        if fast is slow:\r\n            break\r\n    return fast\r\n\r\ncircle_head = ListNode.fromlist([1,2,3])\r\ncircle = ListNode(-9)\r\ncircle_head.next.next.next = circle\r\ndummy = circle\r\nfor i in range(4, 7):\r\n    circle.next = ListNode(i)\r\n    circle = circle.next\r\ncircle.next = dummy\r\n\r\nassert find_loop_idx(circle_head).val == -9\r\n<\/pre>\n
\u5224\u65ad\u4e24\u4e2a\u94fe\u8868\u662f\u5426\u76f8\u4ea4<\/h1>\n
\u9898\u76ee\u63cf\u8ff0\uff1a\u7ed9\u51fa\u4e24\u4e2a\u5355\u5411\u94fe\u8868\u7684\u5934\u6307\u9488\uff08\u5982\u4e0b\u56fe\u6240\u793a\uff09<\/p>\n
\u6bd4\u5982h1\u3001h2\uff0c\u5224\u65ad\u8fd9\u4e24\u4e2a\u94fe\u8868\u662f\u5426\u76f8\u4ea4\u3002\u8fd9\u91cc\u4e3a\u4e86\u7b80\u5316\u95ee\u9898\uff0c\u6211\u4eec\u5047\u8bbe\u4e24\u4e2a\u94fe\u8868\u5747\u4e0d\u5e26\u73af\u3002<\/p>\n
\u89e3\u9898\u601d\u8def\uff1a<\/p>\n
    \n
  • \u76f4\u63a5\u5faa\u73af\u5224\u65ad\u7b2c\u4e00\u4e2a\u94fe\u8868\u7684\u6bcf\u4e2a\u8282\u70b9\u662f\u5426\u5728\u7b2c\u4e8c\u4e2a\u94fe\u8868\u4e2d\u3002\u4f46\uff0c\u8fd9\u79cd\u65b9\u6cd5\u7684\u65f6\u95f4\u590d\u6742\u5ea6\u4e3aO(Length(h1) * Length(h2))\u3002\u663e\u7136\uff0c\u6211\u4eec\u5f97\u627e\u5230\u4e00\u79cd\u66f4\u4e3a\u6709\u6548\u7684\u65b9\u6cd5\uff0c\u81f3\u5c11\u4e0d\u80fd\u662fO\uff08N^2\uff09\u7684\u590d\u6742\u5ea6\u3002<\/li>\n
  • \u9488\u5bf9\u7b2c\u4e00\u4e2a\u94fe\u8868\u76f4\u63a5\u6784\u9020hash\u8868\uff0c\u7136\u540e\u67e5\u8be2hash\u8868\uff0c\u5224\u65ad\u7b2c\u4e8c\u4e2a\u94fe\u8868\u7684\u6bcf\u4e2a\u8282\u70b9\u662f\u5426\u5728hash\u8868\u51fa\u73b0\uff0c\u5982\u679c\u6240\u6709\u7684\u7b2c\u4e8c\u4e2a\u94fe\u8868\u7684\u8282\u70b9\u90fd\u80fd\u5728hash\u8868\u4e2d\u627e\u5230\uff0c\u5373\u8bf4\u660e\u7b2c\u4e8c\u4e2a\u94fe\u8868\u4e0e\u7b2c\u4e00\u4e2a\u94fe\u8868\u6709\u76f8\u540c\u7684\u8282\u70b9\u3002\u65f6\u95f4\u590d\u6742\u5ea6\u4e3a\u4e3a\u7ebf\u6027\uff1aO(Length(h1) + Length(h2))\uff0c\u540c\u65f6\u4e3a\u4e86\u5b58\u50a8\u7b2c\u4e00\u4e2a\u94fe\u8868\u7684\u6240\u6709\u8282\u70b9\uff0c\u7a7a\u95f4\u590d\u6742\u5ea6\u4e3aO(Length(h1))\u3002\u662f\u5426\u8fd8\u6709\u66f4\u597d\u7684\u65b9\u6cd5\u5462\uff0c\u65e2\u80fd\u591f\u4ee5\u7ebf\u6027\u65f6\u95f4\u590d\u6742\u5ea6\u89e3\u51b3\u95ee\u9898\uff0c\u53c8\u80fd\u51cf\u5c11\u5b58\u50a8\u7a7a\u95f4\uff1f<\/li>\n
  • \u8f6c\u6362\u4e3a\u73af\u7684\u95ee\u9898\u3002\u628a\u7b2c\u4e8c\u4e2a\u94fe\u8868\u63a5\u5728\u7b2c\u4e00\u4e2a\u94fe\u8868\u540e\u9762\uff0c\u5982\u679c\u5f97\u5230\u7684\u94fe\u8868\u6709\u73af\uff0c\u5219\u8bf4\u660e\u4e24\u4e2a\u94fe\u8868\u76f8\u4ea4\u3002\u5982\u4f55\u5224\u65ad\u6709\u73af\u7684\u95ee\u9898\u4e0a\u9762\u5df2\u7ecf\u8ba8\u8bba\u8fc7\u4e86\uff0c\u4f46\u8fd9\u91cc\u6709\u66f4\u7b80\u5355\u7684\u65b9\u6cd5\u3002\u56e0\u4e3a\u5982\u679c\u6709\u73af\uff0c\u5219\u7b2c\u4e8c\u4e2a\u94fe\u8868\u7684\u8868\u5934\u4e00\u5b9a\u4e5f\u5728\u73af\u4e0a\uff0c\u5373\u7b2c\u4e8c\u4e2a\u94fe\u8868\u4f1a\u6784\u6210\u4e00\u4e2a\u5faa\u73af\u94fe\u8868\uff0c\u6211\u4eec\u53ea\u9700\u8981\u904d\u5386\u7b2c\u4e8c\u4e2a\u94fe\u8868\uff0c\u770b\u662f\u5426\u4f1a\u56de\u5230\u8d77\u59cb\u70b9\u5c31\u53ef\u4ee5\u5224\u65ad\u51fa\u6765\u3002\u8fd9\u4e2a\u65b9\u6cd5\u7684\u65f6\u95f4\u590d\u6742\u5ea6\u662f\u7ebf\u6027\u7684\uff0c\u7a7a\u95f4\u662f\u5e38\u719f\u3002<\/li>\n
  • \u8fdb\u4e00\u6b65\u8003\u8651\u201c\u5982\u679c\u4e24\u4e2a\u6ca1\u6709\u73af\u7684\u94fe\u8868\u76f8\u4ea4\u4e8e\u67d0\u4e00\u8282\u70b9\uff0c\u90a3\u4e48\u5728\u8fd9\u4e2a\u8282\u70b9\u4e4b\u540e\u7684\u6240\u6709\u8282\u70b9\u90fd\u662f\u4e24\u4e2a\u94fe\u8868\u5171\u6709\u7684\u201d\u8fd9\u4e2a\u7279\u70b9\uff0c\u6211\u4eec\u53ef\u4ee5\u77e5\u9053\uff0c\u5982\u679c\u5b83\u4eec\u76f8\u4ea4\uff0c\u5219\u6700\u540e\u4e00\u4e2a\u8282\u70b9\u4e00\u5b9a\u662f\u5171\u6709\u7684\u3002\u800c\u6211\u4eec\u5f88\u5bb9\u6613\u80fd\u5f97\u5230\u94fe\u8868\u7684\u6700\u540e\u4e00\u4e2a\u8282\u70b9\uff0c\u6240\u4ee5\u8fd9\u6210\u4e86\u6211\u4eec\u7b80\u5316\u89e3\u6cd5\u7684\u4e00\u4e2a\u4e3b\u8981\u7a81\u7834\u53e3\u3002\u90a3\u4e48\uff0c\u6211\u4eec\u53ea\u8981\u5224\u65ad\u4e24\u4e2a\u94fe\u8868\u7684\u5c3e\u6307\u9488\u662f\u5426\u76f8\u7b49\u3002\u76f8\u7b49\uff0c\u5219\u94fe\u8868\u76f8\u4ea4\uff1b\u5426\u5219\uff0c\u94fe\u8868\u4e0d\u76f8\u4ea4\u3002\u6240\u4ee5\uff0c\u5148\u904d\u5386\u7b2c\u4e00\u4e2a\u94fe\u8868\uff0c\u8bb0\u4f4f\u6700\u540e\u4e00\u4e2a\u8282\u70b9\u3002\u7136\u540e\u904d\u5386\u7b2c\u4e8c\u4e2a\u94fe\u8868\uff0c\u5230\u6700\u540e\u4e00\u4e2a\u8282\u70b9\u65f6\u548c\u7b2c\u4e00\u4e2a\u94fe\u8868\u7684\u6700\u540e\u4e00\u4e2a\u8282\u70b9\u505a\u6bd4\u8f83\uff0c\u5982\u679c\u76f8\u540c\uff0c\u5219\u76f8\u4ea4\uff0c\u5426\u5219\uff0c\u4e0d\u76f8\u4ea4\u3002\u8fd9\u6837\u6211\u4eec\u5c31\u5f97\u5230\u4e86\u4e00\u4e2a\u65f6\u95f4\u590d\u6742\u5ea6\uff0c\u5b83\u4e3aO((Length(h1) + Length(h2))\uff0c\u800c\u4e14\u53ea\u7528\u4e86\u4e00\u4e2a\u989d\u5916\u7684\u6307\u9488\u6765\u5b58\u50a8\u6700\u540e\u4e00\u4e2a\u8282\u70b9\u3002\u8fd9\u4e2a\u65b9\u6cd5\u65f6\u95f4\u590d\u6742\u5ea6\u4e3a\u7ebf\u6027O(N)\uff0c\u7a7a\u95f4\u590d\u6742\u5ea6\u4e3aO(1)\uff0c\u663e\u7136\u6bd4\u89e3\u6cd5\u4e09\u66f4\u80dc\u4e00\u7b79\u3002<\/li>\n<\/ul>\n
    \r\ndef is_crossed(a, b):\r\n    if not a or not b:\r\n        return False\r\n    while a.next:\r\n        a = a.next\r\n    while b.next:\r\n        b = b.next\r\n    return a is b\r\n\r\na = ListNode.fromlist([1,2,3])\r\nb = ListNode.fromlist([1])\r\ncrossed_nodes = ListNode(11)\r\ncrossed_nodes.next = ListNode(12)\r\ncrossed_nodes.next.next = ListNode(13)\r\na.next.next.next = crossed_nodes\r\nb.next = crossed_nodes\r\n\r\nassert is_crossed(a, b) == True\r\nassert a.tolist() == [1,2,3,11,12,13]\r\nassert b.tolist() == [1,11,12,13]\r\n<\/pre>\n
    \u4e24\u94fe\u8868\u76f8\u4ea4\u7684\u7b2c\u4e00\u4e2a\u516c\u5171\u8282\u70b9<\/h1>\n
    \u9898\u76ee\u63cf\u8ff0\uff1a\u5982\u679c\u4e24\u4e2a\u65e0\u73af\u5355\u94fe\u8868\u76f8\u4ea4\uff0c\u600e\u4e48\u6c42\u51fa\u4ed6\u4eec\u76f8\u4ea4\u7684\u7b2c\u4e00\u4e2a\u8282\u70b9\u5462\uff1f<\/p>\n
    \u5206\u6790\uff1a\u91c7\u7528\u5bf9\u9f50\u7684\u601d\u60f3\u3002\u8ba1\u7b97\u4e24\u4e2a\u94fe\u8868\u7684\u957f\u5ea6 L1 , L2\uff0c\u5206\u522b\u7528\u4e24\u4e2a\u6307\u9488 p1 , p2 \u6307\u5411\u4e24\u4e2a\u94fe\u8868\u7684\u5934\uff0c\u7136\u540e\u5c06\u8f83\u957f\u94fe\u8868\u7684 p1\uff08\u5047\u8bbe\u4e3a p1\uff09\u5411\u540e\u79fb\u52a8L2 – L1\u4e2a\u8282\u70b9\uff0c\u7136\u540e\u518d\u540c\u65f6\u5411\u540e\u79fb\u52a8p1 , p2\uff0c\u76f4\u5230 p1 = p2\u3002\u76f8\u9047\u7684\u70b9\u5c31\u662f\u76f8\u4ea4\u7684\u7b2c\u4e00\u4e2a\u8282\u70b9\u3002<\/p>\n
    \r\ndef listnode_length(node):\r\n    if not node: return 0\r\n    ret, head = 1, node.next\r\n    while head:\r\n        ret += 1\r\n        head = head.next\r\n    return ret\r\n\r\ndef find_cross(a, b):\r\n    len1 = listnode_length(a)\r\n    len2 = listnode_length(b)\r\n    diff_len = abs(len1-len2)-1\r\n    shorter_node = a if len1<len2 else b while diff_len>0:\r\n        shorter_node = shorter_node.next\r\n        diff_len -= 1\r\n    return shorter_node\r\n\r\na = ListNode.fromlist([1,2,3])\r\nb = ListNode.fromlist([1])\r\ncrossed_nodes = ListNode(11)\r\ncrossed_nodes.next = ListNode(12)\r\ncrossed_nodes.next.next = ListNode(13)\r\na.next.next.next = crossed_nodes\r\nb.next = crossed_nodes\r\n\r\nassert find_cross(a, b).val == 11\r\n<\/pre>\n
    \u94fe\u8868\u6709\u73af\uff0c\u5982\u4f55\u5224\u65ad\u76f8\u4ea4<\/h1>\n
    \u9898\u76ee\u63cf\u8ff0\uff1a\u4e0a\u9762\u7684\u95ee\u9898\u90fd\u662f\u9488\u5bf9\u94fe\u8868\u65e0\u73af\u7684\uff0c\u90a3\u4e48\u5982\u679c\u73b0\u5728\uff0c\u94fe\u8868\u662f\u6709\u73af\u7684\u5462?\u4e0a\u9762\u7684\u65b9\u6cd5\u8fd8\u540c\u6837\u6709\u6548\u4e48?<\/p>\n
    \u5206\u6790\uff1a\u5982\u679c\u6709\u73af\u4e14\u4e24\u4e2a\u94fe\u8868\u76f8\u4ea4\uff0c\u5219\u4e24\u4e2a\u94fe\u8868\u90fd\u6709\u5171\u540c\u4e00\u4e2a\u73af\uff0c\u5373\u73af\u4e0a\u7684\u4efb\u610f\u4e00\u4e2a\u8282\u70b9\u90fd\u5b58\u5728\u4e8e\u4e24\u4e2a\u94fe\u8868\u4e0a\u3002\u56e0\u6b64\uff0c\u5c31\u53ef\u4ee5\u5224\u65ad\u4e00\u94fe\u8868\u4e0a\u4fe9\u6307\u9488\u76f8\u9047\u7684\u90a3\u4e2a\u8282\u70b9\uff0c\u5728\u4e0d\u5728\u53e6\u4e00\u6761\u94fe\u8868\u4e0a\u3002<\/p>\n
    \u5c06\u94fe\u8868\u4ee5K\u4e2a\u957f\u5ea6\u4e3a\u5355\u4f4d\u8fdb\u884c\u7ffb\u8f6c<\/h1>\n
    \u5269\u4f59\u4e0d\u8db3K\u957f\u7684\u90e8\u5206\u4fdd\u6301\u4e0d\u53d8\uff0cLeetCode\u4e0a\u9762\u6709\u8fd9\u9053\u9898\u76ee\uff0c\u53c2\u8003 https:\/\/leetcode.com\/problems\/reverse-nodes-in-k-group\/description\/<\/p>\n
    \u4f8b\u5982\uff0c\u76ee\u6807\u94fe\u8868\u4e3a: [1,2,3,4,5,6,7,8,9,10]<\/p>\n
    k=2\u65f6\uff0c\u8fd4\u56de [2, 1, 4, 3, 6, 5, 8, 7, 10, 9]
    \nk=3\u65f6\uff0c\u8fd4\u56de [3, 2, 1, 6, 5, 4, 9, 8, 7, 10]<\/p>\n
    \u601d\u8def1\uff1a\u4ece\u5934\u5230\u5c3e\u4f9d\u6b21\u7ffb\u8f6ck\u4e2a\u5355\u4f4d\uff0c\u7136\u540e\u5224\u65ad\u6700\u540e\u4e00\u6b21\u7ffb\u8f6c\u7684\u4e2a\u6570\u4e0d\u8db3k\u4e2a\u7684\uff0c\u518d\u628a\u6700\u540e\u5c3e\u5df4\u51e0\u4e2a\u7ffb\u8f6c\u56de\u53bb\u3002<\/p>\n
    \r\n\r\ndef reverseKGroup1(self, head, k):\r\n    """\r\n    :type head: ListNode\r\n    :type k: int\r\n    :rtype: ListNode\r\n    """\r\n    if k==1 or not head:\r\n        return head\r\n    curhead, newhead, curtail = head, head, None\r\n    p1, p2, steps = head, head.next, 1\r\n    \r\n    while p2:\r\n        tmp = p2.next\r\n        p2.next = p1\r\n        if curtail:\r\n            curtail.next = p2\r\n            \r\n        steps += 1\r\n        if steps == k:\r\n            curhead.next = tmp\r\n            if newhead is head: # \u7b2c\u4e00\u6b21\u7ffb\u8f6c\u540e\u7684head\u505a\u4e3a\u6700\u7ec8\u7684\u5934\r\n                newhead = p2\r\n            curtail = curhead\r\n            \r\n            if not tmp:\r\n                break\r\n\r\n            steps = 1\r\n            curhead = tmp\r\n            p1 = tmp\r\n            p2 = tmp.next\r\n        else:\r\n            if not tmp:\r\n                break\r\n            p1 = p2\r\n            p2 = tmp\r\n            \r\n    # \u6700\u540e\u4e0d\u8db3k\u4e2a\u6570\u7684\uff0c\u518d\u7ffb\u8f6c\u8fc7\u6765\r\n    if steps != k:\r\n        curhead.next = None\r\n        curhead = curtail.next if curtail else p2\r\n        if curhead:\r\n            p1, p2 = curhead, curhead.next\r\n            while p2:\r\n                tmp = p2.next\r\n                p2.next = p1\r\n                p1 = p2\r\n                p2 = tmp\r\n            if curtail:\r\n                curtail.next = p1\r\n            curhead.next = None\r\n    \r\n    return newhead\r\n\r\nif __name__ == '__main__':\r\n\r\n    head = ListNode.fromlist([1,2,3,4,5,6,7,8,9,10,]) # 3,4,5,6,7,8,9,10,11,12\r\n    new = reverseKGroup(head, 2)\r\n    print new.tolist()\r\n<\/pre>\n
    \u601d\u8def2\uff1a\u5148\u5224\u65ad\u76ee\u524d\u7684\u957f\u5ea6\u591f\u4e0d\u591fk\uff0c\u4e0d\u591f\u5c31\u4e0d\u7528\u7ffb\u8f6c\uff0c\u591f\u7684\u8bdd\u518d\u8fdb\u884c\u7ffb\u8f6c\u3002<\/p>\n
    \r\ndef reverseKGroup(head, k):\r\n    if k==1 or not head:\r\n        return head\r\n    dummy = jump = ListNode(-1)\r\n    dummy.next = l = r = head\r\n    \r\n    while True:\r\n        count = 0\r\n        while r and count < k:\r\n            r = r.next\r\n            count += 1\r\n        \r\n        if count != k:\r\n            break\r\n        \r\n        pre, cur = r, l\r\n        for _ in range(k):\r\n            cur.next, pre, cur = pre, cur, cur.next\r\n        jump.next, jump, l = pre, l, r\r\n\r\n    return dummy.next\r\n<\/pre>\n
    \u601d\u8def3\uff1a\u9012\u5f52\u6cd5<\/p>\n
    \r\ndef reverseKGroup(head, k):\r\n    curr, count = head, 0\r\n    while count < k and curr: # find the k+1 node\r\n        curr, count = curr.next, count+1\r\n    if count != k:\r\n        return head\r\n\r\n    # if k+1 node is found\r\n    curr = reverseKGroup(curr, k)  # reverse list with k+1 node as head\r\n    while count > 0: # reverse current k-group: \r\n        count -= 1\r\n        tmp = head.next\r\n        head.next = curr\r\n        curr = head\r\n        head = tmp\r\n\r\n    head = curr\r\n    return head\r\n<\/pre>\n
    \u4ee5\u67d0\u4e2a\u503c\u4e3a\u754c\u7ebf\u5206\u5272\u94fe\u8868<\/h1>\n
    Partition\u7b97\u6cd5\uff0c\u7ed9\u5b9a\u4e00\u4e2a\u94fe\u8868\u53ca\u6570\u503cx\uff0c\u65b0\u751f\u6210\u4e00\u4e2a\u94fe\u8868\uff0c\u4f7f\u5f97\u94fe\u8868\u5de6\u534a\u90e8\u5206\u5168\u90e8\u5c0f\u4e8ex\uff0c\u53f3\u8fb9\u90e8\u5206\u5927\u4e8e\u7b49\u4e8ex\uff0c\u4e14\u5de6\u53f3\u4e24\u8fb9\u90e8\u5206\u4fdd\u6301\u539f\u6709\u7684\u987a\u5e8f\u3002<\/p>\n
    \u5982\u8f93\u5165 1->4->3->2->5->2 \uff0c x = 3,
    \n\u8fd4\u56de\u00a0 \u00a0 1->2->2->4->3->5.<\/p>\n
    \u8fd9\u4e2a\u4e5f\u662fLeetCode\u4e0a\u9762\u7684\u9898\u76ee\uff1ahttps:\/\/leetcode.com\/problems\/partition-list\/description\/<\/p>\n
    \u89e3\u9898\u601d\u8def\u662f\u7ef4\u62a4\u4e24\u4e2a\u94fe\u8868\uff0c\u7b2c\u4e00\u4e2a\u5b58\u50a8\u6240\u6709\u6bd4x\u5c0f\u7684\u8282\u70b9\uff0c\u7b2c\u4e8c\u4e2a\u5b58\u50a8\u5176\u5b83\u7684\u8282\u70b9\uff0c\u6700\u540e\u5c06\u4e24\u6761\u94fe\u8868\u8fde\u63a5\u8d77\u6765\u3002\u6ce8\u610f\u7b2c\u4e8c\u6761\u94fe\u8868\u7684\u6700\u540e\u4e00\u4e2a\u8282\u70b9\u7684next\u8981\u8bbe\u7f6e\u6210\u7a7a\uff0c\u5426\u5219\u53ef\u80fd\u5b58\u5728\u73af\u3002<\/p>\n
    \r\n\r\ndef partition(head, x):\r\n    dummy1, dummy2 = ListNode(-1), ListNode(-1)\r\n    curr1, curr2 = dummy1, dummy2\r\n    while head:\r\n        if head.val < x:\r\n            curr1.next = head\r\n            curr1 = curr1.next\r\n        else:\r\n            curr2.next = head\r\n            curr2 = curr2.next\r\n        head = head.next\r\n    curr1.next = dummy2.next\r\n    curr2.next = None\r\n    return dummy1.next\r\n\r\nif __name__ == '__main__':\r\n    head = ListNode.fromlist([1,4,3,2,5,2])\r\n    new = partition(head, 3)\r\n    assert new.tolist() == [1,2,2,4,3,5]\r\n\r\n<\/pre>\n
    \u5bf9\u4e00\u4e2a\u94fe\u8868\u8fdb\u884c\u6392\u5e8f<\/h1>\n
    \u8981\u6c42\u4f7f\u7528\u5e38\u91cf\u7684\u7a7a\u95f4\u590d\u6742\u5ea6\u3002LeetCode\u9898\u76ee\uff1ahttps:\/\/leetcode.com\/problems\/sort-list\/description\/<\/p>\n
    \u601d\u8def\uff0c\u91c7\u7528Merge\u6392\u5e8f\u65b9\u6cd5\uff0c\u628a\u94fe\u8868\u5206\u6210\u4e24\u534a\uff0c\u9012\u5f52\u5bf9\u5de6\u53f3\u4e24\u534a\u5206\u522b\u8fdb\u884c\u6392\u5e8f\uff0c\u518d\u628a\u6392\u5e8f\u597d\u7684\u4e24\u534a\u8fdb\u884cmerge\u3002<\/p>\n
    \r\n\r\ndef sort_listnode(head):\r\n    """\r\n    :type head: ListNode\r\n    :rtype: ListNode\r\n    """\r\n    if not head or not head.next:\r\n        return head\r\n    slow = fast = head\r\n    pre = None\r\n    while fast and fast.next:\r\n        pre = slow\r\n        slow = slow.next\r\n        fast = fast.next.next\r\n    # \u4ee5slow\u524d\u4e00\u4e2a\u8282\u70b9\u4e3a\u5206\u754c\uff0c\u5206\u4e3a\u5de6\u53f3\u4e24\u534a\u90e8\u5206\r\n    pre.next = None\r\n    left = sort_listnode(head)\r\n    right = sort_listnode(slow)\r\n    # merge\u6392\u5e8f\u597d\u7684\u4e24\u90e8\u5206\r\n    return merge_listnode(left, right)\r\n\r\ndef merge_listnode(left, right):\r\n    l = p = ListNode(-1)\r\n    while left and right:\r\n        if left.val < right.val:\r\n            p.next = left\r\n            left = left.next\r\n        else:\r\n            p.next = right\r\n            right = right.next\r\n        p = p.next\r\n    if left:\r\n        p.next = left\r\n    if right:\r\n        p.next = right\r\n    return l.next\r\n\r\nif __name__ == '__main__':\r\n    head = ListNode.fromlist([1,4,3,9,2,5,2])\r\n    new = sort_listnode(head)\r\n    assert new.tolist() == [1,2,2,3,4,5,9]\r\n\r\n<\/pre>\n
    \u68c0\u67e5\u94fe\u8868\u662f\u5426\u4e3a\u56de\u6587<\/h1>\n
    \u89e3\u6cd51\uff1a\u53cd\u8f6c\u5e76\u6bd4\u8f83\u3002
    \n\u7b2c\u4e00\u79cd\u89e3\u6cd5\u662f\u53cd\u8f6c\u6574\u4e2a\u94fe\u8868\uff0c\u7136\u540e\u6bd4\u8f83\u53cd\u8f6c\u94fe\u8868\u548c\u539f\u59cb\u94fe\u8868\u3002\u82e5\u4e24\u8005\u76f8\u540c\uff0c\u5219\u8be5\u94fe\u8868\u4e3a\u56de\u6587\u3002
    \n\u6ce8\u610f\uff0c\u5728\u6bd4\u8f83\u539f\u59cb\u94fe\u8868\u548c\u53cd\u8f6c\u94fe\u8868\u65f6\uff0c\u5176\u5b9e\u53ea\u9700\u6bd4\u8f83\u94fe\u8868\u7684\u524d\u534a\u90e8\u5206\u3002\u82e5\u539f\u59cb\u94fe\u8868\u548c\u53cd\u8f6c\u94fe\u8868\u7684\u524d\u534a\u90e8\u5206\u76f8\u540c\uff0c\u90a3\u4e48\uff0c\u4e24\u8005\u7684\u540e\u534a\u90e8\u5206\u80af\u5b9a\u76f8\u540c\u3002<\/p>\n
    \u89e3\u6cd52\uff1a\u8fed\u4ee3\u6cd5
    \n\u8981\u60f3\u63a2\u6d4b\u94fe\u8868\u7684\u524d\u534a\u90e8\u5206\u662f\u5426\u4e3a\u540e\u534a\u90e8\u5206\u53cd\u8f6c\u800c\u6210\uff0c\u8be5\u600e\u4e48\u505a\u5462\uff1f\u53ea\u9700\u5c06\u94fe\u8868\u524d\u534a\u90e8\u5206\u53cd\u8f6c\uff0c\u53ef\u4ee5\u5229\u7528\u6808\u6765\u5b9e\u73b0\u3002
    \n\u6211\u4eec\u9700\u8981\u5c06\u524d\u534a\u90e8\u5206\u7ed3\u70b9\u5165\u6808\u3002\u6839\u636e\u94fe\u8868\u957f\u5ea6\u5df2\u77e5\u4e0e\u5426\uff0c\u5165\u6808\u6709\u4e24\u79cd\u65b9\u5f0f\u3002
    \n\u82e5\u94fe\u8868\u957f\u5ea6\u5df2\u77e5\uff0c\u53ef\u4ee5\u7528\u6807\u51c6for\u8fed\u4ee3\u8bbf\u95ee\u524d\u534a\u90e8\u5206\u7ed3\u70b9\uff0c\u5c06\u6bcf\u4e2a\u7ed3\u70b9\u5165\u6808\u3002\u5f53\u7136\uff0c\u8981\u5c0f\u5fc3\u5904\u7406\u94fe\u8868\u957f\u5ea6\u4e3a\u5947\u6570\u7684\u60c5\u51b5\u3002
    \n\u82e5\u94fe\u8868\u957f\u5ea6\u672a\u77e5\uff0c\u5219\u53ef\u5229\u7528\u4e0a\u9762\u7684\u5feb\u6162runner\u65b9\u6cd5\u8fed\u4ee3\u8bbf\u95ee\u94fe\u8868\uff0c\u627e\u5230\u4e2d\u95f4\u4f4d\u7f6e\u3002\u4ee3\u7801\u5982\u4e0b\uff1a<\/p>\n
    \r\n\r\ndef is_palindrome(head):\r\n    fast = head\r\n    slow = head\r\n    stack = []\r\n    while fast and fast.next:\r\n        stack.append(slow.val)\r\n        fast = fast.next.next\r\n        slow = slow.next\r\n\r\n    if fast: # lenth is odd\r\n        slow = slow.next\r\n\r\n    while slow:\r\n        if slow.val != stack.pop():\r\n            return False\r\n        slow = slow.next\r\n    return True\r\n\r\nif __name__ == '__main__':\r\n    arr = [1, 3, 1, 4, 5, 3, 6, 2]\r\n    node = ListNode.fromlist(arr)\r\n    assert is_palindrome(node) == False\r\n    arr = [1, 3, 1, 4, 1, 3, 1]\r\n    node = ListNode.fromlist(arr)\r\n    assert is_palindrome(node) == True\r\n    arr = [1, 3, 1, 4, 4, 1, 3, 1]\r\n    node = ListNode.fromlist(arr)\r\n    assert is_palindrome(node) == True\r\n    \r\n<\/pre>\n
     <\/p>\n","protected":false},"excerpt":{"rendered":"
    \u672c\u6587\u7528\u5230\u7684\u94fe\u8868python\u5b9e\u73b0\u7c7b\u5982\u4e0b\uff1a class ListNode(object): def __init_ […]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[6],"tags":[],"class_list":["post-6513","post","type-post","status-publish","format-standard","hentry","category-code_related"],"_links":{"self":[{"href":"https:\/\/kyle.ai\/blog\/wp-json\/wp\/v2\/posts\/6513","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/kyle.ai\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/kyle.ai\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/kyle.ai\/blog\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/kyle.ai\/blog\/wp-json\/wp\/v2\/comments?post=6513"}],"version-history":[{"count":8,"href":"https:\/\/kyle.ai\/blog\/wp-json\/wp\/v2\/posts\/6513\/revisions"}],"predecessor-version":[{"id":7890,"href":"https:\/\/kyle.ai\/blog\/wp-json\/wp\/v2\/posts\/6513\/revisions\/7890"}],"wp:attachment":[{"href":"https:\/\/kyle.ai\/blog\/wp-json\/wp\/v2\/media?parent=6513"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/kyle.ai\/blog\/wp-json\/wp\/v2\/categories?post=6513"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/kyle.ai\/blog\/wp-json\/wp\/v2\/tags?post=6513"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}