{"id":437,"date":"2026-01-29T18:57:49","date_gmt":"2026-01-29T10:57:49","guid":{"rendered":"https:\/\/jdoxk3.cn\/?p=437"},"modified":"2026-01-29T18:57:50","modified_gmt":"2026-01-29T10:57:50","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%e5%9b%9b%e5%a4%a9-226-%e7%bf%bb%e8%bd%ac%e4%ba%8c%e5%8f%89%e6%a0%91%ef%bc%8c101-%e5%af%b9","status":"publish","type":"post","link":"https:\/\/jdoxk3.cn\/index.php\/2026\/01\/29\/%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%e5%9b%9b%e5%a4%a9-226-%e7%bf%bb%e8%bd%ac%e4%ba%8c%e5%8f%89%e6%a0%91%ef%bc%8c101-%e5%af%b9\/","title":{"rendered":"\u4ee3\u7801\u968f\u60f3\u5f55\u7b97\u6cd5\u8bad\u7ec3\u8425\u7b2c\u5341\u56db\u5929 | 226.\u7ffb\u8f6c\u4e8c\u53c9\u6811\uff0c101.\u5bf9\u79f0\u4e8c\u53c9\u6811\uff0c104.\u4e8c\u53c9\u6811\u7684\u6700\u5927\u6df1\u5ea6\uff0c111.\u4e8c\u53c9\u6811\u7684\u6700\u5c0f\u6df1\u5ea6"},"content":{"rendered":"\n<h1 class=\"wp-block-heading\">\u524d\u8a00<\/h1>\n\n\n\n<p>\u4eca\u5929\u662f\u7b97\u6cd5\u8bad\u7ec3\u8425\u7684\u7b2c\u5341\u56db\u5929\uff0c\u4eca\u5929\u7684\u9898\u76ee\u603b\u4f53\u96be\u5ea6\u6bd4\u8f83\u7b80\u5355\uff0c\u4e0d\u8fc7\u8fd8\u662f\u633a\u8003\u601d\u7ef4\u6d3b\u6027\u7684\u3002<\/p>\n\n\n\n<h1 class=\"wp-block-heading\">226.\u7ffb\u8f6c\u4e8c\u53c9\u6811<\/h1>\n\n\n\n<p>\u9898\u76ee\u94fe\u63a5\uff1a<a href=\"https:\/\/leetcode.cn\/problems\/invert-binary-tree\/\">226. \u7ffb\u8f6c\u4e8c\u53c9\u6811<\/a><\/p>\n\n\n\n<p>\u9898\u76ee\u63cf\u8ff0\uff1a<\/p>\n\n\n\n<blockquote class=\"wp-block-quote is-layout-flow wp-block-quote-is-layout-flow\">\n<p>\u7ed9\u4f60\u4e00\u68f5\u4e8c\u53c9\u6811\u7684\u6839\u8282\u70b9 <code>root<\/code> \uff0c\u7ffb\u8f6c\u8fd9\u68f5\u4e8c\u53c9\u6811\uff0c\u5e76\u8fd4\u56de\u5176\u6839\u8282\u70b9\u3002<\/p>\n<\/blockquote>\n\n\n\n<h2 class=\"wp-block-heading\">\u601d\u8def<\/h2>\n\n\n\n<p>\u521a\u770b\u5230\u8fd9\u9053\u9898\u8fd8\u662f\u6709\u70b9\u61f5\u903c\u7684\uff0c\u5982\u679c\u8981\u628a\u6574\u68f5\u6811\u90fd\u7ffb\u8f6c\uff0c\u5b9e\u9645\u4e0a\u53ea\u8981\u628a\u6bcf\u4e2a\u8282\u70b9\u7684\u5de6\u53f3\u5b69\u5b50\u7ffb\u8f6c\u4e00\u4e0b\u5373\u53ef\u3002\u5173\u952e\u5728\u4e8e\u8981\u4f7f\u7528\u54ea\u79cd\u904d\u5386\u987a\u5e8f\uff0c\u8fd9\u9053\u9898\u524d\u5e8f\u548c\u540e\u5e8f\u90fd\u53ef\u884c\uff0c\u4f46\u662f\u4e2d\u5e8f\u904d\u5386\u4e0d\u53ef\uff0c\u9700\u8981\u6ce8\u610f\u4e2d\u5e8f\u904d\u5386\u6bcf\u6b21\u7ffb\u8f6c\u5de6\u53f3\u5b69\u5b50\u65f6\uff0c\u7ffb\u8f6c\u7684\u5177\u4f53\u662f\u54ea\u4e2a\u8282\u70b9\u7684\u5de6\u53f3\u5b69\u5b50\uff0c\u5982\u679c\u7ee7\u7eed\u4f9d\u7167\u524d\u5e8f\u3001\u540e\u5e8f\u65b9\u5f0f\u7ffb\u8f6c\u5c06\u5bfc\u81f4\u5de6\u53f3\u5b69\u5b50\u7ffb\u8f6c\u4e24\u6b21\uff0c\u7ea6\u7b49\u4e8e\u6ca1\u7ffb\u8f6c\u3002<\/p>\n\n\n\n<h2 class=\"wp-block-heading\">\u9012\u5f52\u6cd5\u5199\u6cd5<\/h2>\n\n\n\n<p>\u540e\u5e8f\u904d\u5386\u548c\u524d\u5e8f\u5dee\u4e0d\u591a\uff0c\u53ea\u662f\u6539\u4e86\u4e00\u4e0b\u5904\u7406\u987a\u5e8f\uff0c\u6b64\u5904\u53ea\u5c55\u793a\u524d\u5e8f\u904d\u5386<\/p>\n\n\n\n<pre class=\"wp-block-code\"><code># 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 invertTree(self, root: Optional&#91;TreeNode]) -> Optional&#91;TreeNode]:\n        if not root:\n            return root\n        root.left, root.right = root.right, root.left\n        self.invertTree(root.left)\n        self.invertTree(root.right)\n        return root<\/code><\/pre>\n\n\n\n<h2 class=\"wp-block-heading\">\u8fed\u4ee3\u6cd5\u5199\u6cd5<\/h2>\n\n\n\n<pre class=\"wp-block-code\"><code># 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 invertTree(self, root: Optional&#91;TreeNode]) -> Optional&#91;TreeNode]:\n        if not root:\n            return root\n        stack = &#91;root]\n        while stack:\n            node = stack.pop()\n            node.left, node.right = node.right, node.left\n            if node.right: stack.append(node.right)\n            if node.left: stack.append(node.left)\n        return root<\/code><\/pre>\n\n\n\n<h2 class=\"wp-block-heading\">\u5c42\u5e8f\u904d\u5386\u5199\u6cd5<\/h2>\n\n\n\n<pre class=\"wp-block-code\"><code># 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 invertTree(self, root: Optional&#91;TreeNode]) -> Optional&#91;TreeNode]:\n        if not root:\n            return root\n        queue = collections.deque(&#91;root])\n        while queue:\n            levelSize = len(queue)\n            for _ in range(levelSize):\n                node = queue.popleft()\n                node.left, node.right = node.right, node.left\n                if node.left: queue.append(node.left)\n                if node.right: queue.append(node.right)\n        return root<\/code><\/pre>\n\n\n\n<h1 class=\"wp-block-heading\">101.\u5bf9\u79f0\u4e8c\u53c9\u6811<\/h1>\n\n\n\n<p>\u9898\u76ee\u94fe\u63a5\uff1a<a href=\"https:\/\/leetcode.cn\/problems\/symmetric-tree\/\">101. \u5bf9\u79f0\u4e8c\u53c9\u6811<\/a><\/p>\n\n\n\n<p>\u9898\u76ee\u63cf\u8ff0\uff1a<\/p>\n\n\n\n<blockquote class=\"wp-block-quote is-layout-flow wp-block-quote-is-layout-flow\">\n<p>\u7ed9\u4f60\u4e00\u4e2a\u4e8c\u53c9\u6811\u7684\u6839\u8282\u70b9 <code>root<\/code> \uff0c \u68c0\u67e5\u5b83\u662f\u5426\u8f74\u5bf9\u79f0\u3002<\/p>\n<\/blockquote>\n\n\n\n<h2 class=\"wp-block-heading\">\u601d\u8def<\/h2>\n\n\n\n<p>\u6bd4\u8f83\u4e8c\u53c9\u6811\u662f\u5426\u5bf9\u79f0\uff0c\u5b9e\u9645\u4e0a\u8fd8\u662f\u5728\u6bd4\u8f83\u6bcf\u4e00\u4e2a\u5de6\u5b69\u5b50\u7684\u5de6\u5b69\u5b50\u662f\u5426\u548c\u53f3\u5b69\u5b50\u7684\u53f3\u5b69\u5b50\u76f8\u7b49\uff0c\u5de6\u5b69\u5b50\u7684\u53f3\u5b69\u5b50\u662f\u5426\u548c\u53f3\u5b69\u5b50\u7684\u5de6\u5b69\u5b50\u76f8\u7b49\u3002\u7531\u4e8e\u662f\u8981\u5bf9\u5b69\u5b50\u8fdb\u884c\u6bd4\u8f83\uff0c\u6240\u4ee5\u7528\u540e\u5e8f\u904d\u5386\u6bd4\u8f83\u5408\u9002\uff0c\u9012\u5f52\u903b\u8f91\u662f\u4e0d\u65ad\u6bd4\u8f83\u6839\u8282\u70b9\u5de6\u53f3\u4e24\u9897\u5b50\u6811\u7684\u5185\u5916\u4fa7\u662f\u5426\u76f8\u7b49\uff0c\u5982\u679c\u5168\u90e8\u76f8\u7b49\u5219\u662f\u5bf9\u79f0\u4e8c\u53c9\u6811\u3002<\/p>\n\n\n\n<p>\u4e0d\u8fc7\uff0c\u8fd9\u9053\u9898\u4f9d\u7136\u53ef\u4ee5\u4f7f\u7528\u5c42\u5e8f\u904d\u5386\u6765\u89e3\u51b3\uff0c\u5e76\u4e14\u5c42\u5e8f\u904d\u5386\u4f3c\u4e4e\u66f4\u52a0\u7b80\u5355\uff0c\u6211\u4eec\u53ea\u9700\u8981\u628a\u6bcf\u4e00\u5c42\u7684\u5185\u5bb9\u8bb0\u5f55\u4e0b\u6765\uff0c\u518d\u5c06\u6bcf\u4e00\u5c42\u5185\u5bb9\u5012\u5e8f\u4e0e\u6b63\u5e8f\u6bd4\u8f83\u662f\u5426\u76f8\u7b49\u5373\u53ef\u3002<\/p>\n\n\n\n<h2 class=\"wp-block-heading\">\u9012\u5f52\u5199\u6cd5<\/h2>\n\n\n\n<pre class=\"wp-block-code\"><code># 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 compare(self,left, right):\n        if left == None and right == None:\n            return True\n        elif left != None and right == None:\n            return False\n        elif left == None and right != None:\n            return False\n        elif left.val != right.val:\n            return False\n\n        outside = self.compare(left.left, right.right)\n        inside = self.compare(left.right, right.left)\n        isSame = outside and inside\n        return isSame\n\n    def isSymmetric(self, root: Optional&#91;TreeNode]) -> bool:\n        if not root:\n            return True\n        return self.compare(root.left, root.right)<\/code><\/pre>\n\n\n\n<h2 class=\"wp-block-heading\">\u5c42\u5e8f\u904d\u5386\u5199\u6cd5<\/h2>\n\n\n\n<pre class=\"wp-block-code\"><code># 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 isSymmetric(self, root: Optional&#91;TreeNode]) -> bool:\n        if not root:\n            return root\n        queue = collections.deque(&#91;root])\n        while queue:\n            levelSize = len(queue)\n            vals = &#91;]\n            for i in range(levelSize):\n                node = queue.popleft()\n                if node:\n                    vals.append(node.val)              \n                    queue.append(node.left)\n                    queue.append(node.right)\n                else:\n                    vals.append(None)\n            if vals&#91;::] != vals&#91;::-1]:\n                return False\n        return True<\/code><\/pre>\n\n\n\n<h1 class=\"wp-block-heading\">104.\u4e8c\u53c9\u6811\u7684\u6700\u5927\u6df1\u5ea6<\/h1>\n\n\n\n<p>\u9898\u76ee\u94fe\u63a5\uff1a<a href=\"https:\/\/leetcode.cn\/problems\/maximum-depth-of-binary-tree\/\">104. \u4e8c\u53c9\u6811\u7684\u6700\u5927\u6df1\u5ea6<\/a><\/p>\n\n\n\n<p>\u9898\u76ee\u63cf\u8ff0\uff1a<\/p>\n\n\n\n<blockquote class=\"wp-block-quote is-layout-flow wp-block-quote-is-layout-flow\">\n<p>\u7ed9\u5b9a\u4e00\u4e2a\u4e8c\u53c9\u6811 <code>root<\/code> \uff0c\u8fd4\u56de\u5176\u6700\u5927\u6df1\u5ea6\u3002<\/p>\n\n\n\n<p>\u4e8c\u53c9\u6811\u7684 <strong>\u6700\u5927\u6df1\u5ea6<\/strong> \u662f\u6307\u4ece\u6839\u8282\u70b9\u5230\u6700\u8fdc\u53f6\u5b50\u8282\u70b9\u7684\u6700\u957f\u8def\u5f84\u4e0a\u7684\u8282\u70b9\u6570\u3002<\/p>\n<\/blockquote>\n\n\n\n<h2 class=\"wp-block-heading\">\u601d\u8def<\/h2>\n\n\n\n<p>\u521a\u770b\u5230\u8fd9\u9053\u9898\u7684\u601d\u8def\u662f\u4f7f\u7528\u5c42\u5e8f\u904d\u5386\uff0c\u56e0\u4e3a\u662f\u9010\u5c42\u5904\u7406\uff0c\u6240\u4ee5\u53ea\u8981\u518d\u6bcf\u4e00\u5c42\u90fd\u8fdb\u884c\u8bb0\u5f55\u5c31\u53ef\u4ee5\u5f97\u5230\u6700\u5927\u6df1\u5ea6\u4e86\u3002<\/p>\n\n\n\n<h2 class=\"wp-block-heading\">\u5c42\u5e8f\u904d\u5386\u505a\u6cd5<\/h2>\n\n\n\n<pre class=\"wp-block-code\"><code># 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 maxDepth(self, root: Optional&#91;TreeNode]) -> int:\n        if not root:\n            return 0\n        queue = collections.deque(&#91;root])\n        ans = 0\n        while queue:\n            levelSize = len(queue)\n            for i in range(levelSize):\n                node = queue.popleft()\n                if node.left:\n                    queue.append(node.left)\n                if node.right:\n                    queue.append(node.right)\n            ans += 1\n        return ans<\/code><\/pre>\n\n\n\n<h1 class=\"wp-block-heading\">111.\u4e8c\u53c9\u6811\u7684\u6700\u5c0f\u6df1\u5ea6<\/h1>\n\n\n\n<p>\u9898\u76ee\u94fe\u63a5\uff1a<a href=\"https:\/\/leetcode.cn\/problems\/minimum-depth-of-binary-tree\/\">111. \u4e8c\u53c9\u6811\u7684\u6700\u5c0f\u6df1\u5ea6<\/a><\/p>\n\n\n\n<p>\u9898\u76ee\u63cf\u8ff0\uff1a<\/p>\n\n\n\n<blockquote class=\"wp-block-quote is-layout-flow wp-block-quote-is-layout-flow\">\n<p>\u7ed9\u5b9a\u4e00\u4e2a\u4e8c\u53c9\u6811\uff0c\u627e\u51fa\u5176\u6700\u5c0f\u6df1\u5ea6\u3002<\/p>\n\n\n\n<p>\u6700\u5c0f\u6df1\u5ea6\u662f\u4ece\u6839\u8282\u70b9\u5230\u6700\u8fd1\u53f6\u5b50\u8282\u70b9\u7684\u6700\u77ed\u8def\u5f84\u4e0a\u7684\u8282\u70b9\u6570\u91cf\u3002<\/p>\n\n\n\n<p><strong>\u8bf4\u660e\uff1a<\/strong>\u53f6\u5b50\u8282\u70b9\u662f\u6307\u6ca1\u6709\u5b50\u8282\u70b9\u7684\u8282\u70b9\u3002<\/p>\n<\/blockquote>\n\n\n\n<h2 class=\"wp-block-heading\">\u601d\u8def<\/h2>\n\n\n\n<p>\u8fd9\u9053\u9898\u5982\u679c\u7528\u5c42\u5e8f\u904d\u5386\u89e3\u51b3\uff0c\u601d\u8def\u548c\u6c42\u6700\u5927\u6df1\u5ea6\u5dee\u4e0d\u591a\uff0c\u53ea\u662f\u6362\u4e86\u4e2a\u65b9\u5411\u800c\u5df2\uff0c\u6211\u89c9\u5f97\u4f7f\u7528\u5c42\u5e8f\u904d\u5386\u89e3\u51b3\u8fd9\u7c7b\u95ee\u9898\u6bd4\u8f83\u65b9\u4fbf\uff0c\u6240\u4ee5\u6682\u65f6\u53ea\u5b66\u4e60\u5c42\u5e8f\u904d\u5386\u89e3\u6cd5<\/p>\n\n\n\n<h2 class=\"wp-block-heading\">\u5c42\u5e8f\u904d\u5386\u89e3\u6cd5<\/h2>\n\n\n\n<pre class=\"wp-block-code\"><code># 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 minDepth(self, root: Optional&#91;TreeNode]) -> int:\n        if not root:\n            return 0 \n        queue = collections.deque(&#91;root])\n        ans = 0\n        while queue:\n            levelSize = len(queue)\n            for i in range(levelSize):\n                node = queue.popleft()\n                if not node.left and not node.right:\n                    return ans + 1\n                if node.left:\n                    queue.append(node.left)\n                if node.right:\n                    queue.append(node.right)\n            ans += 1\n        return ans<\/code><\/pre>\n\n\n\n<h1 class=\"wp-block-heading\">\u603b\u7ed3<\/h1>\n\n\n\n<p>\u4eca\u5929\u7684\u9898\u76ee\u603b\u4f53\u6765\u8bf4\u8fd8\u662f\u633a\u6709\u8da3\u7684\uff0c\u6700\u5927\u6df1\u5ea6\u548c\u6700\u5c0f\u6df1\u5ea6\u90a3\u8fb9\u7528\u5c42\u5e8f\u904d\u5386\u6c34\u4e86\u4e00\u4e0b\uff0c\u76ee\u524d\u4e8c\u53c9\u6811\u7684\u51e0\u79cd\u904d\u5386\u65b9\u5f0f\u8fd8\u662f\u5c42\u5e8f\u904d\u5386\u6700\u6df1\u5f97\u6211\u5fc3\u3002<\/p>\n\n\n\n<p><\/p>\n","protected":false},"excerpt":{"rendered":"<p>\u524d\u8a00 \u4eca\u5929\u662f\u7b97\u6cd5\u8bad\u7ec3\u8425\u7684\u7b2c\u5341\u56db\u5929\uff0c\u4eca\u5929\u7684\u9898\u76ee\u603b\u4f53\u96be\u5ea6\u6bd4\u8f83\u7b80\u5355\uff0c\u4e0d\u8fc7\u8fd8\u662f\u633a\u8003\u601d\u7ef4\u6d3b\u6027\u7684\u3002 226.\u7ffb\u8f6c\u4e8c\u53c9\u6811 \u9898 [&hellip;]<\/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-437","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\/437","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=437"}],"version-history":[{"count":1,"href":"https:\/\/jdoxk3.cn\/index.php\/wp-json\/wp\/v2\/posts\/437\/revisions"}],"predecessor-version":[{"id":438,"href":"https:\/\/jdoxk3.cn\/index.php\/wp-json\/wp\/v2\/posts\/437\/revisions\/438"}],"wp:attachment":[{"href":"https:\/\/jdoxk3.cn\/index.php\/wp-json\/wp\/v2\/media?parent=437"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/jdoxk3.cn\/index.php\/wp-json\/wp\/v2\/categories?post=437"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/jdoxk3.cn\/index.php\/wp-json\/wp\/v2\/tags?post=437"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}