{"id":447,"date":"2026-02-22T22:43:41","date_gmt":"2026-02-22T14:43:41","guid":{"rendered":"https:\/\/jdoxk3.cn\/?p=447"},"modified":"2026-02-23T19:32:11","modified_gmt":"2026-02-23T11:32:11","slug":"%e4%bb%a3%e7%a0%81%e9%9a%8f%e6%83%b3%e5%bd%95%e7%ae%97%e6%b3%95%e8%ae%ad%e7%bb%83%e8%90%a5%e7%ac%ac%e5%8d%81%e4%b8%83%e5%a4%a9654-%e6%9c%80%e5%a4%a7%e4%ba%8c%e5%8f%89%e6%a0%91%ef%bc%8c617-%e5%90%88","status":"publish","type":"post","link":"https:\/\/jdoxk3.cn\/index.php\/2026\/02\/22\/%e4%bb%a3%e7%a0%81%e9%9a%8f%e6%83%b3%e5%bd%95%e7%ae%97%e6%b3%95%e8%ae%ad%e7%bb%83%e8%90%a5%e7%ac%ac%e5%8d%81%e4%b8%83%e5%a4%a9654-%e6%9c%80%e5%a4%a7%e4%ba%8c%e5%8f%89%e6%a0%91%ef%bc%8c617-%e5%90%88\/","title":{"rendered":"\u4ee3\u7801\u968f\u60f3\u5f55\u7b97\u6cd5\u8bad\u7ec3\u8425\u7b2c\u5341\u4e03\u5929|654.\u6700\u5927\u4e8c\u53c9\u6811\uff0c617.\u5408\u5e76\u4e8c\u53c9\u6811\uff0c700.\u4e8c\u53c9\u641c\u7d22\u6811\u4e2d\u7684\u641c\u7d22\uff0c98.\u9a8c\u8bc1\u4e8c\u53c9\u641c\u7d22\u6811"},"content":{"rendered":"\n

\u524d\u8a00<\/h1>\n\n\n\n

\u4eca\u5929\u662f\u7b97\u6cd5\u8bad\u7ec3\u8425\u7684\u7b2c\u5341\u4e03\u5929\uff08\u5e76\u975e\uff09\uff1f\u4f9d\u65e7\u662f\u72c2\u8ffd\u4e4b\u524d\u6f0f\u5199\u7684\u603b\u7ed3\uff0c\u4e0d\u8fc7\u7ecf\u8fc7\u4e0a\u4e00\u7bc7\u603b\u7ed3\uff0c\u6211\u53d1\u73b0\u9694\u4e2a\u51e0\u5929\u518d\u56de\u987e\u8c8c\u4f3c\u4e5f\u6709\u4e9b\u8bb8\u597d\u5904\uff0c\u4f46\u8fd9\u79cd\u597d\u5904\u6211\u89c9\u5f97\u8fd8\u662f\u653e\u5728\u7b2c\u4e8c\u8f6e\u56de\u987e\u65f6\u6548\u679c\u66f4\u4f73\u660e\u663e\uff0c\u73b0\u5728\u7684\u4efb\u52a1\u662f\u731b\u8ffd\u503a\u3002<\/p>\n\n\n\n

654.\u6700\u5927\u4e8c\u53c9\u6811<\/h1>\n\n\n\n

\u9898\u76ee\u94fe\u63a5\uff1a654. \u6700\u5927\u4e8c\u53c9\u6811<\/a><\/p>\n\n\n\n

\u9898\u76ee\u63cf\u8ff0\uff1a<\/p>\n\n\n\n

\n

\u7ed9\u5b9a\u4e00\u4e2a\u4e0d\u91cd\u590d\u7684\u6574\u6570\u6570\u7ec4 nums<\/code> \u3002 \u6700\u5927\u4e8c\u53c9\u6811<\/strong> \u53ef\u4ee5\u7528\u4e0b\u9762\u7684\u7b97\u6cd5\u4ece nums<\/code> \u9012\u5f52\u5730\u6784\u5efa:<\/p>\n\n\n\n

    \n
  1. \u521b\u5efa\u4e00\u4e2a\u6839\u8282\u70b9\uff0c\u5176\u503c\u4e3a nums<\/code> \u4e2d\u7684\u6700\u5927\u503c\u3002<\/li>\n\n\n\n
  2. \u9012\u5f52\u5730\u5728\u6700\u5927\u503c \u5de6\u8fb9<\/strong> \u7684 \u5b50\u6570\u7ec4\u524d\u7f00\u4e0a<\/strong> \u6784\u5efa\u5de6\u5b50\u6811\u3002<\/li>\n\n\n\n
  3. \u9012\u5f52\u5730\u5728\u6700\u5927\u503c \u53f3\u8fb9<\/strong> \u7684 \u5b50\u6570\u7ec4\u540e\u7f00\u4e0a<\/strong> \u6784\u5efa\u53f3\u5b50\u6811\u3002<\/li>\n<\/ol>\n\n\n\n

    \u8fd4\u56de nums<\/code> \u6784\u5efa\u7684<\/em> *\u6700\u5927\u4e8c\u53c9\u6811*<\/strong> \u3002<\/p>\n<\/blockquote>\n\n\n\n

    \u601d\u8def<\/h2>\n\n\n\n

    \u9996\u5148\u5206\u6790\u4e00\u4e0b\u9898\u76ee\u8981\u6c42\uff0c\u6211\u4eec\u8981\u505a\u7684\u4e8b\u662f\u786e\u5b9anums\u4e2d\u7684\u6700\u5927\u503c\uff0c\u4ee5\u6b64\u521b\u5efa\u6839\u8282\u70b9\uff0c\u7136\u540e\u4ee5\u6b64\u4e3a\u5207\u5272\u70b9\uff0c\u5207\u5272\u70b9\u5de6\u8fb9\u7684\u5185\u5bb9\u6784\u5efa\u5de6\u5b50\u6811\uff0c\u5207\u5272\u70b9\u53f3\u8fb9\u7684\u5185\u5bb9\u6784\u5efa\u53f3\u5b50\u6811\u3002<\/p>\n\n\n\n

    \u4e0b\u9762\u662f\u9012\u5f52\u4e09\u90e8\u66f2\uff1a<\/p>\n\n\n\n

    1.\u786e\u5b9a\u53c2\u6570\u548c\u8fd4\u56de\u503c<\/strong><\/p>\n\n\n\n

    \u53c2\u6570\u4e3b\u8981\u662fnums\u6570\u7ec4\uff0c\u8fd4\u56de\u503c\u662f\u8fd4\u56de\u6784\u9020\u5b8c\u7684\u6839\u8282\u70b9<\/p>\n\n\n\n

     def constructMaximumBinaryTree(self, nums: List[int]) -> Optional[TreeNode]:<\/code><\/pre>\n\n\n\n
    2.\u786e\u5b9a\u7ec8\u6b62\u6761\u4ef6<\/strong><\/p>\n\n\n\n
    \u8f93\u5165\u8fdb\u7684\u6570\u7ec4\u4e3a\u7a7a\u65f6\uff0c\u4ee3\u8868\u5df2\u7ecf\u6ca1\u6709\u5269\u4f59\u9700\u8981\u5904\u7406\u7684\u5185\u5bb9\uff0c\u6b64\u65f6\u5c31\u53ef\u4ee5\u7ec8\u6b62\u4e86<\/p>\n\n\n\n
    if not nums:\n    return  <\/code><\/pre>\n\n\n\n
    3.\u786e\u5b9a\u5355\u6b65\u5faa\u73af\u903b\u8f91<\/strong><\/p>\n\n\n\n
    \u8fd9\u91cc\u6211\u4eec\u6bcf\u4e00\u6b65\u8981\u505a\u7684\u662f\uff0c\u627e\u5230\u6570\u7ec4\u4e2d\u5269\u4f59\u7684\u6700\u5927\u503c\uff0c\u4ee5\u6b64\u4e3a\u5207\u5272\u70b9\u5272\u6210\u5de6\u53f3\u4e24\u90e8\u5206\uff0c\u7136\u540e\u518d\u5206\u5de6\u53f3\u8fdb\u884c\u9012\u5f52\u5904\u7406<\/p>\n\n\n\n
    maxVal = max(nums)\nmaxValIdx = nums.index(maxVal)\nnode =TreeNode(maxVal)\nnode.left = self.constructMaximumBinaryTree(nums[:maxValIdx])\nnode.right = self.constructMaximumBinaryTree(nums[maxValIdx + 1:])<\/code><\/pre>\n\n\n\n
    \u6574\u4f53\u5b9e\u73b0\u5199\u6cd5<\/h2>\n\n\n\n
    # Definition for a binary tree node.\n# class TreeNode:\n#     def __init__(self, val=0, left=None, right=None):\n#         self.val = val\n#         self.left = left\n#         self.right = right\nclass Solution:\n    def constructMaximumBinaryTree(self, nums: List[int]) -> Optional[TreeNode]:\n        if not nums:\n            return \n        maxVal = max(nums)\n        maxValIdx = nums.index(maxVal)\n        node =TreeNode(maxVal)\n        node.left = self.constructMaximumBinaryTree(nums[:maxValIdx])\n        node.right = self.constructMaximumBinaryTree(nums[maxValIdx + 1:])\n        return node<\/code><\/pre>\n\n\n\n
    617.\u5408\u5e76\u4e8c\u53c9\u6811<\/h1>\n\n\n\n
    \u9898\u76ee\u94fe\u63a5\uff1a617. \u5408\u5e76\u4e8c\u53c9\u6811<\/a><\/p>\n\n\n\n
    \u9898\u76ee\u63cf\u8ff0\uff1a<\/p>\n\n\n\n
    \n
    \u7ed9\u4f60\u4e24\u68f5\u4e8c\u53c9\u6811\uff1a root1<\/code> \u548c root2<\/code> \u3002<\/p>\n\n\n\n
    \u60f3\u8c61\u4e00\u4e0b\uff0c\u5f53\u4f60\u5c06\u5176\u4e2d\u4e00\u68f5\u8986\u76d6\u5230\u53e6\u4e00\u68f5\u4e4b\u4e0a\u65f6\uff0c\u4e24\u68f5\u6811\u4e0a\u7684\u4e00\u4e9b\u8282\u70b9\u5c06\u4f1a\u91cd\u53e0\uff08\u800c\u53e6\u4e00\u4e9b\u4e0d\u4f1a\uff09\u3002\u4f60\u9700\u8981\u5c06\u8fd9\u4e24\u68f5\u6811\u5408\u5e76\u6210\u4e00\u68f5\u65b0\u4e8c\u53c9\u6811\u3002\u5408\u5e76\u7684\u89c4\u5219\u662f\uff1a\u5982\u679c\u4e24\u4e2a\u8282\u70b9\u91cd\u53e0\uff0c\u90a3\u4e48\u5c06\u8fd9\u4e24\u4e2a\u8282\u70b9\u7684\u503c\u76f8\u52a0\u4f5c\u4e3a\u5408\u5e76\u540e\u8282\u70b9\u7684\u65b0\u503c\uff1b\u5426\u5219\uff0c\u4e0d\u4e3a<\/strong> null \u7684\u8282\u70b9\u5c06\u76f4\u63a5\u4f5c\u4e3a\u65b0\u4e8c\u53c9\u6811\u7684\u8282\u70b9\u3002<\/p>\n\n\n\n
    \u8fd4\u56de\u5408\u5e76\u540e\u7684\u4e8c\u53c9\u6811\u3002<\/p>\n\n\n\n
    \u6ce8\u610f:<\/strong> \u5408\u5e76\u8fc7\u7a0b\u5fc5\u987b\u4ece\u4e24\u4e2a\u6811\u7684\u6839\u8282\u70b9\u5f00\u59cb\u3002<\/p>\n<\/blockquote>\n\n\n\n
    \u601d\u8def<\/h2>\n\n\n\n
    \u8fd9\u9053\u9898\u6211\u6700\u521d\u7684\u505a\u6cd5\u662f\u901a\u8fc7\u5c42\u5e8f\u904d\u5386\u6765\u5b9e\u73b0\u7684\uff0c\u540c\u65f6\u5c42\u5e8f\u904d\u5386\u4e24\u68f5\u6811\u5e76\u5c06\u4e24\u68f5\u6811\u76f8\u540c\u4f4d\u7f6e\u7684\u6570\u503c\u76f8\u52a0\uff0c\u6700\u540e\u8f93\u51fa\u5c31\u5f97\u5230\u5408\u5e76\u540e\u7684\u7ed3\u679c\u4e86\u3002<\/p>\n\n\n\n
    \u5c42\u5e8f\u904d\u5386\u76f8\u5bf9\u7406\u89e3\u8d77\u6765\u6bd4\u8f83\u7b80\u5355\uff0c\u4e0b\u9762\u8bb2\u4e00\u8bb2\u9012\u5f52\u7684\u5b9e\u73b0\u601d\u8def\u3002<\/p>\n\n\n\n
    \u9012\u5f52\u4e5f\u5f88\u597d\u7406\u89e3\uff0c\u5b9e\u9645\u8981\u505a\u7684\u4e8b\u60c5\u5c31\u662f\u540c\u6b65\u904d\u5386\u4e24\u68f5\u6811\uff0c\u5728\u76f8\u540c\u4f4d\u7f6e\u7684\u8282\u70b9\u5904\u5c06\u4e24\u68f5\u6811\u7684\u8282\u70b9\u6570\u503c\u76f8\u52a0\u5f97\u5230\u5408\u5e76\u540e\u7684\u7ed3\u679c\u3002<\/p>\n\n\n\n
    \u7136\u540e\u662f\u9012\u5f52\u4e09\u90e8\u66f2\uff1a<\/p>\n\n\n\n
    1.\u786e\u5b9a\u53c2\u6570\u548c\u8fd4\u56de\u503c<\/strong><\/p>\n\n\n\n
    \u53c2\u6570\u662f\u4e24\u68f5\u6811\u7684\u6839\u8282\u70b9\uff0c\u8fd4\u56de\u6700\u7ec8\u5408\u5e76\u540e\u7684\u6839\u8282\u70b9\uff08\u5b9e\u9645\u4e0a\u53ea\u8981\u5728\u5176\u4e2d\u4e00\u68f5\u6811\u4e0a\u5b8c\u6210\u5408\u5e76\u64cd\u4f5c\u540e\u8fd4\u56de\u8be5\u6811\u5373\u53ef\uff0c\u4e0d\u7528\u518d\u6784\u5efa\u4e00\u68f5\u65b0\u6811\uff09<\/p>\n\n\n\n
    def mergeTrees(self, root1: Optional[TreeNode], root2: Optional[TreeNode]) -> Optional[TreeNode]:\n    return root1<\/code><\/pre>\n\n\n\n
    2.\u786e\u5b9a\u7ec8\u6b62\u6761\u4ef6<\/strong><\/p>\n\n\n\n
    \u8fd9\u91cc\u7684\u7ec8\u6b62\u6761\u4ef6\u662f\u4e24\u68f5\u6811\u4e2d\u4efb\u610f\u4e00\u68f5\u4e3a\u7a7a\u5c31\u8fd4\u56de<\/p>\n\n\n\n
    if not root1:\n    return root2\nif not root2:\n    return root1<\/code><\/pre>\n\n\n\n
    3.\u786e\u5b9a\u5355\u5c42\u9012\u5f52\u903b\u8f91<\/strong><\/p>\n\n\n\n
    \u6bd4\u8f83\u7b80\u5355\uff0c\u5c31\u662f\u628a\u4e24\u4e2a\u6570\u76f8\u540c\u4f4d\u7f6e\u7684\u6570\u503c\u76f8\u52a0\u8d77\u6765\u800c\u5df2<\/p>\n\n\n\n
    root1.val += root2.val\nroot1.left = self.mergeTrees(root1.left, root2.left)\nroot1.right = self.mergeTrees(root1.right, root2.right)<\/code><\/pre>\n\n\n\n
    \u6574\u4f53\u5b9e\u73b0\u5199\u6cd5<\/h2>\n\n\n\n
    # Definition for a binary tree node.\n# class TreeNode:\n#     def __init__(self, val=0, left=None, right=None):\n#         self.val = val\n#         self.left = left\n#         self.right = right\nclass Solution:\n    def mergeTrees(self, root1: Optional[TreeNode], root2: Optional[TreeNode]) -> Optional[TreeNode]:\n        if not root1:\n            return root2\n        if not root2:\n            return root1\n        root1.val += root2.val\n        root1.left = self.mergeTrees(root1.left, root2.left)\n        root1.right = self.mergeTrees(root1.right, root2.right)\n        return root1<\/code><\/pre>\n\n\n\n
    700.\u4e8c\u53c9\u641c\u7d22\u6811\u4e2d\u7684\u641c\u7d22<\/h1>\n\n\n\n
    \u9898\u76ee\u94fe\u63a5\uff1a700. \u4e8c\u53c9\u641c\u7d22\u6811\u4e2d\u7684\u641c\u7d22<\/a><\/p>\n\n\n\n
    \u9898\u76ee\u63cf\u8ff0\uff1a<\/p>\n\n\n\n
    \n
    \u7ed9\u5b9a\u4e8c\u53c9\u641c\u7d22\u6811\uff08BST\uff09\u7684\u6839\u8282\u70b9 root<\/code> \u548c\u4e00\u4e2a\u6574\u6570\u503c val<\/code>\u3002<\/p>\n\n\n\n
    \u4f60\u9700\u8981\u5728 BST \u4e2d\u627e\u5230\u8282\u70b9\u503c\u7b49\u4e8e val<\/code> \u7684\u8282\u70b9\u3002 \u8fd4\u56de\u4ee5\u8be5\u8282\u70b9\u4e3a\u6839\u7684\u5b50\u6811\u3002 \u5982\u679c\u8282\u70b9\u4e0d\u5b58\u5728\uff0c\u5219\u8fd4\u56de null<\/code> \u3002<\/p>\n<\/blockquote>\n\n\n\n
    \u601d\u8def<\/h2>\n\n\n\n
    \u8fd9\u9053\u9898\u76f8\u5bf9\u6765\u8bf4\u6bd4\u8f83\u7b80\u5355\uff0c\u53ea\u662f\u7528\u6765\u63cf\u8ff0\u4e8c\u53c9\u641c\u7d22\u6811\u7684\u4f7f\u7528\u65b9\u6cd5\uff0c\u603b\u800c\u8a00\u4e4b\u5c31\u662f\u5927\u4e86\u53d6\u5de6\u8fb9\u5c0f\u4e86\u53d6\u53f3\u8fb9\uff0c\u76f4\u5230\u627e\u5230\u76ee\u6807\u503c\u3002<\/p>\n\n\n\n
    \u5b9e\u73b0\u5199\u6cd5\uff1a<\/h2>\n\n\n\n
    # Definition for a binary tree node.\n# class TreeNode:\n#     def __init__(self, val=0, left=None, right=None):\n#         self.val = val\n#         self.left = left\n#         self.right = right\nclass Solution:\n    def searchBST(self, root: Optional[TreeNode], val: int) -> Optional[TreeNode]:\n        if not root:\n            return root\n        stack = [root]\n        while stack:\n            node = stack.pop()\n            if node.val > val and node.left:\n                stack.append(node.left)\n            if node.val < val and node.right:\n                stack.append(node.right)\n            if node.val == val:\n                return node\n        return None<\/code><\/pre>\n\n\n\n
    98.\u9a8c\u8bc1\u4e8c\u53c9\u641c\u7d22\u6811<\/h1>\n\n\n\n
    \u9898\u76ee\u94fe\u63a5\uff1a98. \u9a8c\u8bc1\u4e8c\u53c9\u641c\u7d22\u6811<\/a><\/p>\n\n\n\n
    \u9898\u76ee\u63cf\u8ff0\uff1a<\/p>\n\n\n\n
    \n
    \u7ed9\u4f60\u4e00\u4e2a\u4e8c\u53c9\u6811\u7684\u6839\u8282\u70b9 root<\/code> \uff0c\u5224\u65ad\u5176\u662f\u5426\u662f\u4e00\u4e2a\u6709\u6548\u7684\u4e8c\u53c9\u641c\u7d22\u6811\u3002<\/p>\n\n\n\n
    \u6709\u6548<\/strong> \u4e8c\u53c9\u641c\u7d22\u6811\u5b9a\u4e49\u5982\u4e0b\uff1a<\/p>\n\n\n\n
      \n
    • \u8282\u70b9\u7684\u5de6\u5b50\u6811\u53ea\u5305\u542b \u4e25\u683c\u5c0f\u4e8e<\/strong> \u5f53\u524d\u8282\u70b9\u7684\u6570\u3002<\/li>\n\n\n\n
    • \u8282\u70b9\u7684\u53f3\u5b50\u6811\u53ea\u5305\u542b \u4e25\u683c\u5927\u4e8e<\/strong> \u5f53\u524d\u8282\u70b9\u7684\u6570\u3002<\/li>\n\n\n\n
    • \u6240\u6709\u5de6\u5b50\u6811\u548c\u53f3\u5b50\u6811\u81ea\u8eab\u5fc5\u987b\u4e5f\u662f\u4e8c\u53c9\u641c\u7d22\u6811\u3002<\/li>\n<\/ul>\n<\/blockquote>\n\n\n\n
      \u601d\u8def<\/h2>\n\n\n\n
      \u9a8c\u8bc1\u4e8c\u53c9\u641c\u7d22\u6811\uff0c\u9996\u5148\u6211\u4eec\u9700\u8981\u5bf9\u4e8c\u53c9\u641c\u7d22\u6811\u7684\u5b9a\u4e49\u6bd4\u8f83\u719f\u6089\uff0c\u4e8c\u53c9\u641c\u7d22\u6811\u5b9a\u4e49\u5728\u9898\u76ee\u63cf\u8ff0\u4e2d\u5df2\u7ecf\u7ed9\u51fa\uff0c\u6839\u636e\u4e8c\u53c9\u641c\u7d22\u6811\u7684\u7279\u6027\uff0c\u6211\u4eec\u53ef\u4ee5\u77e5\u9053\u5bf9\u4e8c\u53c9\u641c\u7d22\u6811\u8fdb\u884c\u4e2d\u5e8f\u904d\u5386\uff0c\u6700\u540e\u8f93\u51fa\u7684\u7ed3\u679c\u4e00\u5b9a\u662f\u4e00\u4e2a\u5355\u8c03\u9012\u589e\u7684\u6570\u7ec4\u3002\u6709\u4e86\u4ee5\u4e0a\u7279\u6027\uff0c\u6211\u4eec\u53ea\u8981\u5bf9\u4e8c\u53c9\u641c\u7d22\u6811\u8fdb\u884c\u4e2d\u5e8f\u904d\u5386\u5e76\u6536\u96c6\u8f93\u51fa\u5185\u5bb9\uff0c\u6700\u540e\u5224\u65ad\u662f\u5426\u5355\u8c03\u9012\u589e\u5373\u53ef\u3002<\/p>\n\n\n\n
      \u5b8c\u6574\u4ee3\u7801<\/h2>\n\n\n\n
      # Definition for a binary tree node.\n# class TreeNode:\n#     def __init__(self, val=0, left=None, right=None):\n#         self.val = val\n#         self.left = left\n#         self.right = right\nclass Solution:\n    def isValidBST(self, root: Optional[TreeNode]) -> bool:\n        vec = []\n        self.traversal(root, vec)\n        for i in range(1, len(vec)):\n            if vec[i] <= vec[i - 1]:\n                return False\n        return True\n\n    def traversal(self, root, vec):\n        if not root:\n            return None\n        self.traversal(root.left, vec)\n        vec.append(root.val)\n        self.traversal(root.right, vec)\n        return vec<\/code><\/pre>\n\n\n\n
      \u603b\u7ed3<\/h1>\n\n\n\n
      \u4eca\u5929\u7684\u9898\u76ee\u603b\u4f53\u6765\u8bf4\u6bd4\u8f83\u7b80\u5355\uff0c\u901a\u8fc7\u4ee5\u4e0a\u8bad\u7ec3\uff0c\u6211\u4eec\u5f3a\u5316\u4e86\u5bf9\u4e8e\u4e8c\u53c9\u641c\u7d22\u6811\u7684\u4f7f\u7528\u7406\u89e3\uff0c\u540c\u65f6\u4e5f\u8fdb\u4e00\u6b65\u5de9\u56fa\u9488\u5bf9\u4e8c\u53c9\u6811\u7684\u57fa\u7840\u64cd\u4f5c\u3002<\/p>\n","protected":false},"excerpt":{"rendered":"
      \u524d\u8a00 \u4eca\u5929\u662f\u7b97\u6cd5\u8bad\u7ec3\u8425\u7684\u7b2c\u5341\u4e03\u5929\uff08\u5e76\u975e\uff09\uff1f\u4f9d\u65e7\u662f\u72c2\u8ffd\u4e4b\u524d\u6f0f\u5199\u7684\u603b\u7ed3\uff0c\u4e0d\u8fc7\u7ecf\u8fc7\u4e0a\u4e00\u7bc7\u603b\u7ed3\uff0c\u6211\u53d1\u73b0\u9694\u4e2a\u51e0\u5929\u518d\u56de\u987e\u8c8c […]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[11],"tags":[13,15,14],"class_list":["post-447","post","type-post","status-publish","format-standard","hentry","category-python","tag-python","tag-15","tag-14"],"_links":{"self":[{"href":"https:\/\/jdoxk3.cn\/index.php\/wp-json\/wp\/v2\/posts\/447","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/jdoxk3.cn\/index.php\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/jdoxk3.cn\/index.php\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/jdoxk3.cn\/index.php\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/jdoxk3.cn\/index.php\/wp-json\/wp\/v2\/comments?post=447"}],"version-history":[{"count":3,"href":"https:\/\/jdoxk3.cn\/index.php\/wp-json\/wp\/v2\/posts\/447\/revisions"}],"predecessor-version":[{"id":452,"href":"https:\/\/jdoxk3.cn\/index.php\/wp-json\/wp\/v2\/posts\/447\/revisions\/452"}],"wp:attachment":[{"href":"https:\/\/jdoxk3.cn\/index.php\/wp-json\/wp\/v2\/media?parent=447"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/jdoxk3.cn\/index.php\/wp-json\/wp\/v2\/categories?post=447"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/jdoxk3.cn\/index.php\/wp-json\/wp\/v2\/tags?post=447"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}