2022-03-27 20:38:29 +08:00
{
"data" : {
"question" : {
"questionId" : "100305" ,
"questionFrontendId" : "剑指 Offer 36" ,
"categoryTitle" : "LCOF" ,
"boundTopicId" : 87118 ,
"title" : "二叉搜索树与双向链表 LCOF" ,
"titleSlug" : "er-cha-sou-suo-shu-yu-shuang-xiang-lian-biao-lcof" ,
"content" : "English description is not available for the problem. Please switch to Chinese." ,
"translatedTitle" : "二叉搜索树与双向链表" ,
"translatedContent" : "<p>输入一棵二叉搜索树，将该二叉搜索树转换成一个排序的循环双向链表。要求不能创建任何新的节点，只能调整树中节点指针的指向。</p>\n\n<p> </p>\n\n<p>为了让您更好地理解问题，以下面的二叉搜索树为例：</p>\n\n<p> </p>\n\n<p><img src=\"https://assets.leetcode.com/uploads/2018/10/12/bstdlloriginalbst.png\"></p>\n\n<p> </p>\n\n<p>我们希望将这个二叉搜索树转化为双向循环链表。链表中的每个节点都有一个前驱和后继指针。对于双向循环链表，第一个节点的前驱是最后一个节点，最后一个节点的后继是第一个节点。</p>\n\n<p>下图展示了上面的二叉搜索树转化成的链表。“head” 表示指向链表中有最小元素的节点。</p>\n\n<p> </p>\n\n<p><img src=\"https://assets.leetcode.com/uploads/2018/10/12/bstdllreturndll.png\"></p>\n\n<p> </p>\n\n<p>特别地，我们希望可以就地完成转换操作。当转化完成以后，树中节点的左指针需要指向前驱，树中节点的右指针需要指向后继。还需要返回链表中的第一个节点的指针。</p>\n\n<p> </p>\n\n<p><strong>注意：</strong>本题与主站 426 题相同：<a href=\"https://leetcode-cn.com/problems/convert-binary-search-tree-to-sorted-doubly-linked-list/\">https://leetcode-cn.com/problems/convert-binary-search-tree-to-sorted-doubly-linked-list/</a></p>\n\n<p><strong>注意：</strong>此题对比原题有改动。</p>\n" ,
"isPaidOnly" : false ,
"difficulty" : "Medium" ,
2022-05-02 23:44:12 +08:00
"likes" : 481 ,
2022-03-27 20:38:29 +08:00
"dislikes" : 0 ,
"isLiked" : null ,
"similarQuestions" : "[]" ,
"contributors" : [ ] ,
"langToValidPlayground" : "{\"cpp\": false, \"java\": false, \"python\": false, \"python3\": false, \"mysql\": false, \"mssql\": false, \"oraclesql\": false, \"c\": false, \"csharp\": false, \"javascript\": false, \"ruby\": false, \"bash\": false, \"swift\": false, \"golang\": false, \"scala\": false, \"html\": false, \"pythonml\": false, \"kotlin\": false, \"rust\": false, \"php\": false, \"typescript\": false, \"racket\": false, \"erlang\": false, \"elixir\": false}" ,
"topicTags" : [
{
"name" : "Stack" ,
"slug" : "stack" ,
"translatedName" : "栈" ,
"__typename" : "TopicTagNode"
} ,
{
"name" : "Tree" ,
"slug" : "tree" ,
"translatedName" : "树" ,
"__typename" : "TopicTagNode"
} ,
{
"name" : "Depth-First Search" ,
"slug" : "depth-first-search" ,
"translatedName" : "深度优先搜索" ,
"__typename" : "TopicTagNode"
} ,
{
"name" : "Binary Search Tree" ,
"slug" : "binary-search-tree" ,
"translatedName" : "二叉搜索树" ,
"__typename" : "TopicTagNode"
} ,
{
"name" : "Linked List" ,
"slug" : "linked-list" ,
"translatedName" : "链表" ,
"__typename" : "TopicTagNode"
} ,
{
"name" : "Binary Tree" ,
"slug" : "binary-tree" ,
"translatedName" : "二叉树" ,
"__typename" : "TopicTagNode"
} ,
{
"name" : "Doubly-Linked List" ,
"slug" : "doubly-linked-list" ,
"translatedName" : "双向链表" ,
"__typename" : "TopicTagNode"
}
] ,
"companyTagStats" : null ,
"codeSnippets" : [
{
"lang" : "C++" ,
"langSlug" : "cpp" ,
"code" : "/*\n// Definition for a Node.\nclass Node {\npublic:\n int val;\n Node* left;\n Node* right;\n\n Node() {}\n\n Node(int _val) {\n val = _val;\n left = NULL;\n right = NULL;\n }\n\n Node(int _val, Node* _left, Node* _right) {\n val = _val;\n left = _left;\n right = _right;\n }\n};\n*/\nclass Solution {\npublic:\n Node* treeToDoublyList(Node* root) {\n \n }\n};" ,
"__typename" : "CodeSnippetNode"
} ,
{
"lang" : "Java" ,
"langSlug" : "java" ,
"code" : "/*\n// Definition for a Node.\nclass Node {\n public int val;\n public Node left;\n public Node right;\n\n public Node() {}\n\n public Node(int _val) {\n val = _val;\n }\n\n public Node(int _val,Node _left,Node _right) {\n val = _val;\n left = _left;\n right = _right;\n }\n};\n*/\nclass Solution {\n public Node treeToDoublyList(Node root) {\n \n }\n}" ,
"__typename" : "CodeSnippetNode"
} ,
{
"lang" : "Python" ,
"langSlug" : "python" ,
"code" : "\"\"\"\n# Definition for a Node.\nclass Node(object):\n def __init__(self, val, left=None, right=None):\n self.val = val\n self.left = left\n self.right = right\n\"\"\"\nclass Solution(object):\n def treeToDoublyList(self, root):\n \"\"\"\n :type root: Node\n :rtype: Node\n \"\"\"\n " ,
"__typename" : "CodeSnippetNode"
} ,
{
"lang" : "Python3" ,
"langSlug" : "python3" ,
"code" : "\"\"\"\n# Definition for a Node.\nclass Node:\n def __init__(self, val, left=None, right=None):\n self.val = val\n self.left = left\n self.right = right\n\"\"\"\nclass Solution:\n def treeToDoublyList(self, root: 'Node') -> 'Node':\n " ,
"__typename" : "CodeSnippetNode"
} ,
{
"lang" : "C#" ,
"langSlug" : "csharp" ,
"code" : "/*\n// Definition for a Node.\npublic class Node {\n public int val;\n public Node left;\n public Node right;\n\n public Node() {}\n\n public Node(int _val) {\n val = _val;\n left = null;\n right = null;\n }\n\n public Node(int _val,Node _left,Node _right) {\n val = _val;\n left = _left;\n right = _right;\n }\n}\n*/\n\npublic class Solution {\n public Node TreeToDoublyList(Node root) {\n \n }\n}" ,
"__typename" : "CodeSnippetNode"
} ,
{
"lang" : "JavaScript" ,
"langSlug" : "javascript" ,
"code" : "/**\n * // Definition for a Node.\n * function Node(val,left,right) {\n * this.val = val;\n * this.left = left;\n * this.right = right;\n * };\n */\n/**\n * @param {Node} root\n * @return {Node}\n */\nvar treeToDoublyList = function(root) {\n\n};" ,
"__typename" : "CodeSnippetNode"
}
] ,
2022-05-02 23:44:12 +08:00
"stats" : "{\"totalAccepted\": \"150.7K\", \"totalSubmission\": \"230.9K\", \"totalAcceptedRaw\": 150672, \"totalSubmissionRaw\": 230919, \"acRate\": \"65.2%\"}" ,
2022-03-27 20:38:29 +08:00
"hints" : [ ] ,
"solution" : null ,
"status" : null ,
"sampleTestCase" : "[4,2,5,1,3]" ,
"metaData" : "{\r\n \"name\": \"treeToDoublyList\",\r\n \"params\": [\r\n {\r\n \"name\": \"root\",\r\n \"type\": \"Node\"\r\n }\r\n ],\r\n \"return\": {\r\n \"type\": \"Node\"\r\n },\r\n \"structures\": [\r\n {\r\n \"name\": \"Node\",\r\n \"comment\": \"Definition for a Node.\",\r\n \"members\": [\r\n {\r\n \"name\": \"val\",\r\n \"type\": \"integer\"\r\n },\r\n {\r\n \"name\": \"left\",\r\n \"type\": \"Node\"\r\n },\r\n {\r\n \"name\": \"right\",\r\n \"type\": \"Node\"\r\n }\r\n ]\r\n }\r\n ],\r\n \"languages\": [\r\n \"cpp\",\r\n \"java\",\r\n \"python\",\r\n \"csharp\",\r\n \"javascript\",\r\n \"python3\"\r\n ],\r\n \"manual\": true\r\n}" ,
"judgerAvailable" : true ,
"judgeType" : "large" ,
"mysqlSchemas" : [ ] ,
"enableRunCode" : true ,
"envInfo" : "{\"cpp\":[\"C++\",\"<p>\\u7248\\u672c\\uff1a<code>clang 11<\\/code> \\u91c7\\u7528\\u6700\\u65b0C++ 17\\u6807\\u51c6\\u3002<\\/p>\\r\\n\\r\\n<p>\\u7f16\\u8bd1\\u65f6\\uff0c\\u5c06\\u4f1a\\u91c7\\u7528<code>-O2<\\/code>\\u7ea7\\u4f18\\u5316\\u3002<a href=\\\"https:\\/\\/github.com\\/google\\/sanitizers\\/wiki\\/AddressSanitizer\\\" target=\\\"_blank\\\">AddressSanitizer<\\/a> \\u4e5f\\u88ab\\u5f00\\u542f\\u6765\\u68c0\\u6d4b<code>out-of-bounds<\\/code>\\u548c<code>use-after-free<\\/code>\\u9519\\u8bef\\u3002<\\/p>\\r\\n\\r\\n<p>\\u4e3a\\u4e86\\u4f7f\\u7528\\u65b9\\u4fbf\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8\\u5bfc\\u5165\\u3002<\\/p>\"],\"java\":[\"Java\",\"<p>\\u7248\\u672c\\uff1a<code>OpenJDK 17<\\/code>\\u3002\\u53ef\\u4ee5\\u4f7f\\u7528Java 8\\u7684\\u7279\\u6027\\u4f8b\\u5982\\uff0clambda expressions \\u548c stream API\\u3002<\\/p>\\r\\n\\r\\n<p>\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u88ab\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n<p>\\u5305\\u542b Pair \\u7c7b: https:\\/\\/docs.oracle.com\\/javase\\/8\\/javafx\\/api\\/javafx\\/util\\/Pair.html <\\/p>\"],\"python\":[\"Python\",\"<p>\\u7248\\u672c\\uff1a <code>Python 2.7.12<\\/code><\\/p>\\r\\n\\r\\n<p>\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u5e38\\u7528\\u5e93\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8 \\u5bfc\\u5165\\uff0c\\u5982\\uff1a<a href=\\\"https:\\/\\/docs.python.org\\/2\\/library\\/array.html\\\" target=\\\"_blank\\\">array<\\/a>, <a href=\\\"https:\\/\\/docs.python.org\\/2\\/library\\/bisect.html\\\" target=\\\"_blank\\\">bisect<\\/a>, <a href=\\\"https:\\/\\/docs.python.org\\/2\\/library\\/collections.html\\\" target=\\\"_blank\\\">collections<\\/a>\\u3002\\u5982\\u679c\\u60a8\\u9700\\u8981\\u4f7f\\u7528\\u5176\\u4ed6\\u5e93\\u51fd\\u6570\\uff0c\\u8bf7\\u81ea\\u884c\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n<p>\\u6ce8\\u610f Python 2.7 <a href=\\\"https:\\/\\/www.python.org\\/dev\\/peps\\/pep-0373\\/\\\" target=\\\"_blank\\\">\\u5c06\\u57282020\\u5e74\\u540e\\u4e0d\\u518d\\u7ef4\\u62a4<\\/a>\\u3002 \\u5982\\u60f3\\u4f7f\\u7528\\u6700\\u65b0\\u7248\\u7684Python\\uff0c\\u8bf7\\u9009\\u62e9Python 3\\u3002<\\/p>\"],\"csharp\":[\"C#\",\"<p><a href=\\\"https:\\/\\/docs.microsoft.com\\/en-us\\/dotnet\\/csharp\\/whats-new\\/csharp-9\\\" target=\\\"_blank\\\">C# 10<\\/a> \\u8fd0\\u884c\\u5728 .NET 6 \\u4e0a<\\/p>\\r\\n\\r\\n<p>\\u60a8\\u7684\\u4ee3\\u7801\\u5728\\u7f16\\u8bd1\\u65f6\\u9ed8\\u8ba4\\u5f00\\u542f\\u4e86debug\\u6807\\u8bb0(<code>\\/debug:pdbonly<\\/code>)\\u3002<\\/p>\"],\"javascript\":[\"JavaScript\",\"<p>\\u7248\\u672c\\uff1a<code>Node.js 16.13.2<\\/code><\\/p>\\r\\n\\r\\n<p>\\u60a8\\u7684\\u4ee3\\u7801\\u5728\\u6267\\u884c\\u65f6\\u5c06\\u5e26\\u4e0a <code>--harmony<\\/code> \\u6807\\u8bb0\\u6765\\u5f00\\u542f <a href=\\\"http:\\/\\/node.green\\/\\\" target=\\\"_blank\\\">\\u65b0\\u7248ES6\\u7279\\u6027<\\/a>\\u3002<\\/p>\\r\\n\\r\\n<p><a href=\\\"https:\\/\\/lodash.com\\\" target=\\\"_blank\\\">lodash.js<\\/a> \\u5e93\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5305\\u542b\\u3002<\\/p>\\r\\n\\r\\n<p> \\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 <a href=\\\"https:\\/\\/github.com\\/datastructures-js\\/priority-queue\\\" target=\\\"_blank\\\"> datastructures-js\\/priority-queue<\\/a> \\u548c <a href=\\\"https:\\/\\/github.com\\/datastructures-js\\/queue\\\" target=\\\"_blank\\\"> datastructures-js\\/queue<\\/a>\\u3002<\\/p>\"],\"python3\":[\"Python3\",\"<p>\\u7248\\u672c\\uff1a<code>Python 3.10<\\/code><\\/p>\\r\\n\\r\\n<p>\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u5e38\\u7528\\u5e93\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8 \\u5bfc\\u5165\\uff0c\\u5982<a href=\\\"https:\\/\\/docs.python.org\\/3\\/library\\/array.html\\\" target=\\\"_blank\\\">array<\\/a>, <a href=\\\"https:\\/\\/docs.python.org\\/3\\/library\\/bisect.html\\\" target=\\\"_blank\\\" > b i s e c t < \ \ / a > , < a h r e f =
"book" : {
"id" : "1" ,
"bookName" : "《剑指 Offer（ ,
"pressName" : "电子工业出版社" ,
"source" : "《剑指 Offer（ ,
"shortDescription" : "通行全球的程序员经典面试秘籍" ,
"fullDescription" : "本书精选谷歌、微软等知名IT企业的典型面试题， ， ， ,
"bookImgUrl" : "https://assets.leetcode-cn.com/aliyun-lc-upload/uploads/2020/02/11/lcof.png" ,
"pressImgUrl" : "https://assets.leetcode-cn.com/aliyun-lc-upload/uploads/2020/02/11/logo-01.png" ,
"productUrl" : "" ,
"__typename" : "CategoryInfoNode"
} ,
"isSubscribed" : false ,
"isDailyQuestion" : false ,
"dailyRecordStatus" : null ,
"editorType" : "CKEDITOR" ,
"ugcQuestionId" : null ,
"style" : "LEETCODE" ,
"exampleTestcases" : "" ,
"__typename" : "QuestionNode"
}
}
}
