{ "data": { "question": { "questionId": "100172", "questionFrontendId": "面试题 03.01", "categoryTitle": "LCCI", "boundTopicId": 46167, "title": "Three in One LCCI", "titleSlug": "three-in-one-lcci", "content": "

Describe how you could use a single array to implement three stacks.

\r\n\r\n

You should implement push(stackNum, value)、pop(stackNum)、isEmpty(stackNum)、peek(stackNum) methods. stackNum is the index of the stack. value is the value that pushed to the stack.

\r\n\r\n

The constructor requires a stackSize parameter, which represents the size of each stack.

\r\n\r\n

Example1:

\r\n\r\n
\r\n Input: \r\n["TripleInOne", "push", "push", "pop", "pop", "pop", "isEmpty"]\r\n[[1], [0, 1], [0, 2], [0], [0], [0], [0]]\r\n Output: \r\n[null, null, null, 1, -1, -1, true]\r\nExplanation: When the stack is empty, `pop, peek` return -1. When the stack is full, `push` does nothing.\r\n
\r\n\r\n

Example2:

\r\n\r\n
\r\n Input: \r\n["TripleInOne", "push", "push", "push", "pop", "pop", "pop", "peek"]\r\n[[2], [0, 1], [0, 2], [0, 3], [0], [0], [0], [0]]\r\n Output: \r\n[null, null, null, null, 2, 1, -1, -1]\r\n
\r\n", "translatedTitle": "三合一", "translatedContent": "

三合一。描述如何只用一个数组来实现三个栈。

\n\n

你应该实现push(stackNum, value)、pop(stackNum)、isEmpty(stackNum)、peek(stackNum)方法。stackNum表示栈下标，value表示压入的值。

\n\n

构造函数会传入一个stackSize参数，代表每个栈的大小。

\n\n

示例1:

\n\n
\n 输入：\n[\"TripleInOne\", \"push\", \"push\", \"pop\", \"pop\", \"pop\", \"isEmpty\"]\n[[1], [0, 1], [0, 2], [0], [0], [0], [0]]\n 输出：\n[null, null, null, 1, -1, -1, true]\n说明：当栈为空时`pop, peek`返回-1，当栈满时`push`不压入元素。\n
\n\n

示例2:

\n\n
\n 输入：\n[\"TripleInOne\", \"push\", \"push\", \"push\", \"pop\", \"pop\", \"pop\", \"peek\"]\n[[2], [0, 1], [0, 2], [0, 3], [0], [0], [0], [0]]\n 输出：\n[null, null, null, null, 2, 1, -1, -1]\n
\n\n

 

\n\n

提示：

\n\n\n", "isPaidOnly": false, "difficulty": "Easy", "likes": 49, "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": "Design", "slug": "design", "translatedName": "设计", "__typename": "TopicTagNode" }, { "name": "Array", "slug": "array", "translatedName": "数组", "__typename": "TopicTagNode" } ], "companyTagStats": null, "codeSnippets": [ { "lang": "C++", "langSlug": "cpp", "code": "class TripleInOne {\npublic:\n TripleInOne(int stackSize) {\n\n }\n \n void push(int stackNum, int value) {\n\n }\n \n int pop(int stackNum) {\n\n }\n \n int peek(int stackNum) {\n\n }\n \n bool isEmpty(int stackNum) {\n\n }\n};\n\n/**\n * Your TripleInOne object will be instantiated and called as such:\n * TripleInOne* obj = new TripleInOne(stackSize);\n * obj->push(stackNum,value);\n * int param_2 = obj->pop(stackNum);\n * int param_3 = obj->peek(stackNum);\n * bool param_4 = obj->isEmpty(stackNum);\n */", "__typename": "CodeSnippetNode" }, { "lang": "Java", "langSlug": "java", "code": "class TripleInOne {\n\n public TripleInOne(int stackSize) {\n\n }\n \n public void push(int stackNum, int value) {\n\n }\n \n public int pop(int stackNum) {\n\n }\n \n public int peek(int stackNum) {\n\n }\n \n public boolean isEmpty(int stackNum) {\n\n }\n}\n\n/**\n * Your TripleInOne object will be instantiated and called as such:\n * TripleInOne obj = new TripleInOne(stackSize);\n * obj.push(stackNum,value);\n * int param_2 = obj.pop(stackNum);\n * int param_3 = obj.peek(stackNum);\n * boolean param_4 = obj.isEmpty(stackNum);\n */", "__typename": "CodeSnippetNode" }, { "lang": "Python", "langSlug": "python", "code": "class TripleInOne(object):\n\n def __init__(self, stackSize):\n \"\"\"\n :type stackSize: int\n \"\"\"\n\n\n def push(self, stackNum, value):\n \"\"\"\n :type stackNum: int\n :type value: int\n :rtype: None\n \"\"\"\n\n\n def pop(self, stackNum):\n \"\"\"\n :type stackNum: int\n :rtype: int\n \"\"\"\n\n\n def peek(self, stackNum):\n \"\"\"\n :type stackNum: int\n :rtype: int\n \"\"\"\n\n\n def isEmpty(self, stackNum):\n \"\"\"\n :type stackNum: int\n :rtype: bool\n \"\"\"\n\n\n\n# Your TripleInOne object will be instantiated and called as such:\n# obj = TripleInOne(stackSize)\n# obj.push(stackNum,value)\n# param_2 = obj.pop(stackNum)\n# param_3 = obj.peek(stackNum)\n# param_4 = obj.isEmpty(stackNum)", "__typename": "CodeSnippetNode" }, { "lang": "Python3", "langSlug": "python3", "code": "class TripleInOne:\n\n def __init__(self, stackSize: int):\n\n\n def push(self, stackNum: int, value: int) -> None:\n\n\n def pop(self, stackNum: int) -> int:\n\n\n def peek(self, stackNum: int) -> int:\n\n\n def isEmpty(self, stackNum: int) -> bool:\n\n\n\n# Your TripleInOne object will be instantiated and called as such:\n# obj = TripleInOne(stackSize)\n# obj.push(stackNum,value)\n# param_2 = obj.pop(stackNum)\n# param_3 = obj.peek(stackNum)\n# param_4 = obj.isEmpty(stackNum)", "__typename": "CodeSnippetNode" }, { "lang": "C", "langSlug": "c", "code": "\n\n\ntypedef struct {\n\n} TripleInOne;\n\n\nTripleInOne* tripleInOneCreate(int stackSize) {\n\n}\n\nvoid tripleInOnePush(TripleInOne* obj, int stackNum, int value) {\n\n}\n\nint tripleInOnePop(TripleInOne* obj, int stackNum) {\n\n}\n\nint tripleInOnePeek(TripleInOne* obj, int stackNum) {\n\n}\n\nbool tripleInOneIsEmpty(TripleInOne* obj, int stackNum) {\n\n}\n\nvoid tripleInOneFree(TripleInOne* obj) {\n\n}\n\n/**\n * Your TripleInOne struct will be instantiated and called as such:\n * TripleInOne* obj = tripleInOneCreate(stackSize);\n * tripleInOnePush(obj, stackNum, value);\n \n * int param_2 = tripleInOnePop(obj, stackNum);\n \n * int param_3 = tripleInOnePeek(obj, stackNum);\n \n * bool param_4 = tripleInOneIsEmpty(obj, stackNum);\n \n * tripleInOneFree(obj);\n*/", "__typename": "CodeSnippetNode" }, { "lang": "C#", "langSlug": "csharp", "code": "public class TripleInOne {\n\n public TripleInOne(int stackSize) {\n\n }\n \n public void Push(int stackNum, int value) {\n\n }\n \n public int Pop(int stackNum) {\n\n }\n \n public int Peek(int stackNum) {\n\n }\n \n public bool IsEmpty(int stackNum) {\n\n }\n}\n\n/**\n * Your TripleInOne object will be instantiated and called as such:\n * TripleInOne obj = new TripleInOne(stackSize);\n * obj.Push(stackNum,value);\n * int param_2 = obj.Pop(stackNum);\n * int param_3 = obj.Peek(stackNum);\n * bool param_4 = obj.IsEmpty(stackNum);\n */", "__typename": "CodeSnippetNode" }, { "lang": "JavaScript", "langSlug": "javascript", "code": "/**\n * @param {number} stackSize\n */\nvar TripleInOne = function(stackSize) {\n\n};\n\n/** \n * @param {number} stackNum \n * @param {number} value\n * @return {void}\n */\nTripleInOne.prototype.push = function(stackNum, value) {\n\n};\n\n/** \n * @param {number} stackNum\n * @return {number}\n */\nTripleInOne.prototype.pop = function(stackNum) {\n\n};\n\n/** \n * @param {number} stackNum\n * @return {number}\n */\nTripleInOne.prototype.peek = function(stackNum) {\n\n};\n\n/** \n * @param {number} stackNum\n * @return {boolean}\n */\nTripleInOne.prototype.isEmpty = function(stackNum) {\n\n};\n\n/**\n * Your TripleInOne object will be instantiated and called as such:\n * var obj = new TripleInOne(stackSize)\n * obj.push(stackNum,value)\n * var param_2 = obj.pop(stackNum)\n * var param_3 = obj.peek(stackNum)\n * var param_4 = obj.isEmpty(stackNum)\n */", "__typename": "CodeSnippetNode" }, { "lang": "Ruby", "langSlug": "ruby", "code": "class TripleInOne\n\n=begin\n :type stack_size: Integer\n=end\n def initialize(stack_size)\n\n end\n\n\n=begin\n :type stack_num: Integer\n :type value: Integer\n :rtype: Void\n=end\n def push(stack_num, value)\n\n end\n\n\n=begin\n :type stack_num: Integer\n :rtype: Integer\n=end\n def pop(stack_num)\n\n end\n\n\n=begin\n :type stack_num: Integer\n :rtype: Integer\n=end\n def peek(stack_num)\n\n end\n\n\n=begin\n :type stack_num: Integer\n :rtype: Boolean\n=end\n def is_empty(stack_num)\n\n end\n\n\nend\n\n# Your TripleInOne object will be instantiated and called as such:\n# obj = TripleInOne.new(stack_size)\n# obj.push(stack_num, value)\n# param_2 = obj.pop(stack_num)\n# param_3 = obj.peek(stack_num)\n# param_4 = obj.is_empty(stack_num)", "__typename": "CodeSnippetNode" }, { "lang": "Swift", "langSlug": "swift", "code": "\nclass TripleInOne {\n\n init(_ stackSize: Int) {\n\n }\n \n func push(_ stackNum: Int, _ value: Int) {\n\n }\n \n func pop(_ stackNum: Int) -> Int {\n\n }\n \n func peek(_ stackNum: Int) -> Int {\n\n }\n \n func isEmpty(_ stackNum: Int) -> Bool {\n\n }\n}\n\n/**\n * Your TripleInOne object will be instantiated and called as such:\n * let obj = TripleInOne(stackSize)\n * obj.push(stackNum, value)\n * let ret_2: Int = obj.pop(stackNum)\n * let ret_3: Int = obj.peek(stackNum)\n * let ret_4: Bool = obj.isEmpty(stackNum)\n */", "__typename": "CodeSnippetNode" }, { "lang": "Go", "langSlug": "golang", "code": "type TripleInOne struct {\n\n}\n\n\nfunc Constructor(stackSize int) TripleInOne {\n\n}\n\n\nfunc (this *TripleInOne) Push(stackNum int, value int) {\n\n}\n\n\nfunc (this *TripleInOne) Pop(stackNum int) int {\n\n}\n\n\nfunc (this *TripleInOne) Peek(stackNum int) int {\n\n}\n\n\nfunc (this *TripleInOne) IsEmpty(stackNum int) bool {\n\n}\n\n\n/**\n * Your TripleInOne object will be instantiated and called as such:\n * obj := Constructor(stackSize);\n * obj.Push(stackNum,value);\n * param_2 := obj.Pop(stackNum);\n * param_3 := obj.Peek(stackNum);\n * param_4 := obj.IsEmpty(stackNum);\n */", "__typename": "CodeSnippetNode" }, { "lang": "Scala", "langSlug": "scala", "code": "class TripleInOne(_stackSize: Int) {\n\n def push(stackNum: Int, value: Int) {\n\n }\n\n def pop(stackNum: Int): Int = {\n\n }\n\n def peek(stackNum: Int): Int = {\n\n }\n\n def isEmpty(stackNum: Int): Boolean = {\n\n }\n\n}\n\n/**\n * Your TripleInOne object will be instantiated and called as such:\n * var obj = new TripleInOne(stackSize)\n * obj.push(stackNum,value)\n * var param_2 = obj.pop(stackNum)\n * var param_3 = obj.peek(stackNum)\n * var param_4 = obj.isEmpty(stackNum)\n */", "__typename": "CodeSnippetNode" }, { "lang": "Kotlin", "langSlug": "kotlin", "code": "class TripleInOne(stackSize: Int) {\n\n fun push(stackNum: Int, value: Int) {\n\n }\n\n fun pop(stackNum: Int): Int {\n\n }\n\n fun peek(stackNum: Int): Int {\n\n }\n\n fun isEmpty(stackNum: Int): Boolean {\n\n }\n\n}\n\n/**\n * Your TripleInOne object will be instantiated and called as such:\n * var obj = TripleInOne(stackSize)\n * obj.push(stackNum,value)\n * var param_2 = obj.pop(stackNum)\n * var param_3 = obj.peek(stackNum)\n * var param_4 = obj.isEmpty(stackNum)\n */", "__typename": "CodeSnippetNode" }, { "lang": "Rust", "langSlug": "rust", "code": "struct TripleInOne {\n\n}\n\n\n/**\n * `&self` means the method takes an immutable reference.\n * If you need a mutable reference, change it to `&mut self` instead.\n */\nimpl TripleInOne {\n\n fn new(stackSize: i32) -> Self {\n\n }\n \n fn push(&self, stack_num: i32, value: i32) {\n\n }\n \n fn pop(&self, stack_num: i32) -> i32 {\n\n }\n \n fn peek(&self, stack_num: i32) -> i32 {\n\n }\n \n fn is_empty(&self, stack_num: i32) -> bool {\n\n }\n}\n\n/**\n * Your TripleInOne object will be instantiated and called as such:\n * let obj = TripleInOne::new(stackSize);\n * obj.push(stackNum, value);\n * let ret_2: i32 = obj.pop(stackNum);\n * let ret_3: i32 = obj.peek(stackNum);\n * let ret_4: bool = obj.is_empty(stackNum);\n */", "__typename": "CodeSnippetNode" }, { "lang": "PHP", "langSlug": "php", "code": "class TripleInOne {\n /**\n * @param Integer $stackSize\n */\n function __construct($stackSize) {\n\n }\n\n /**\n * @param Integer $stackNum\n * @param Integer $value\n * @return NULL\n */\n function push($stackNum, $value) {\n\n }\n\n /**\n * @param Integer $stackNum\n * @return Integer\n */\n function pop($stackNum) {\n\n }\n\n /**\n * @param Integer $stackNum\n * @return Integer\n */\n function peek($stackNum) {\n\n }\n\n /**\n * @param Integer $stackNum\n * @return Boolean\n */\n function isEmpty($stackNum) {\n\n }\n}\n\n/**\n * Your TripleInOne object will be instantiated and called as such:\n * $obj = TripleInOne($stackSize);\n * $obj->push($stackNum, $value);\n * $ret_2 = $obj->pop($stackNum);\n * $ret_3 = $obj->peek($stackNum);\n * $ret_4 = $obj->isEmpty($stackNum);\n */", "__typename": "CodeSnippetNode" }, { "lang": "TypeScript", "langSlug": "typescript", "code": "class TripleInOne {\n constructor(stackSize: number) {\n\n }\n\n push(stackNum: number, value: number): void {\n\n }\n\n pop(stackNum: number): number {\n\n }\n\n peek(stackNum: number): number {\n\n }\n\n isEmpty(stackNum: number): boolean {\n\n }\n}\n\n/**\n * Your TripleInOne object will be instantiated and called as such:\n * var obj = new TripleInOne(stackSize)\n * obj.push(stackNum,value)\n * var param_2 = obj.pop(stackNum)\n * var param_3 = obj.peek(stackNum)\n * var param_4 = obj.isEmpty(stackNum)\n */", "__typename": "CodeSnippetNode" }, { "lang": "Racket", "langSlug": "racket", "code": "(define triple-in-one%\n (class object%\n (super-new)\n\n ; stack-size : exact-integer?\n (init-field\n stack-size)\n \n ; push : exact-integer? exact-integer? -> void?\n (define/public (push stackNum value)\n\n )\n ; pop : exact-integer? -> exact-integer?\n (define/public (pop stackNum)\n\n )\n ; peek : exact-integer? -> exact-integer?\n (define/public (peek stackNum)\n\n )\n ; is-empty : exact-integer? -> boolean?\n (define/public (is-empty stackNum)\n\n )))\n\n;; Your triple-in-one% object will be instantiated and called as such:\n;; (define obj (new triple-in-one% [stackSize stackSize]))\n;; (send obj push stack-num value)\n;; (define param_2 (send obj pop stack-num))\n;; (define param_3 (send obj peek stack-num))\n;; (define param_4 (send obj is-empty stack-num))", "__typename": "CodeSnippetNode" }, { "lang": "Erlang", "langSlug": "erlang", "code": "-spec triple_in_one_init_(StackSize :: integer()) -> any().\ntriple_in_one_init_(StackSize) ->\n .\n\n-spec triple_in_one_push(StackNum :: integer(), Value :: integer()) -> any().\ntriple_in_one_push(StackNum, Value) ->\n .\n\n-spec triple_in_one_pop(StackNum :: integer()) -> integer().\ntriple_in_one_pop(StackNum) ->\n .\n\n-spec triple_in_one_peek(StackNum :: integer()) -> integer().\ntriple_in_one_peek(StackNum) ->\n .\n\n-spec triple_in_one_is_empty(StackNum :: integer()) -> boolean().\ntriple_in_one_is_empty(StackNum) ->\n .\n\n\n%% Your functions will be called as such:\n%% triple_in_one_init_(StackSize),\n%% triple_in_one_push(StackNum, Value),\n%% Param_2 = triple_in_one_pop(StackNum),\n%% Param_3 = triple_in_one_peek(StackNum),\n%% Param_4 = triple_in_one_is_empty(StackNum),\n\n%% triple_in_one_init_ will be called before every test case, in which you can do some necessary initializations.", "__typename": "CodeSnippetNode" }, { "lang": "Elixir", "langSlug": "elixir", "code": "defmodule TripleInOne do\n @spec init_(stack_size :: integer) :: any\n def init_(stack_size) do\n\n end\n\n @spec push(stack_num :: integer, value :: integer) :: any\n def push(stack_num, value) do\n\n end\n\n @spec pop(stack_num :: integer) :: integer\n def pop(stack_num) do\n\n end\n\n @spec peek(stack_num :: integer) :: integer\n def peek(stack_num) do\n\n end\n\n @spec is_empty(stack_num :: integer) :: boolean\n def is_empty(stack_num) do\n\n end\nend\n\n# Your functions will be called as such:\n# TripleInOne.init_(stack_size)\n# TripleInOne.push(stack_num, value)\n# param_2 = TripleInOne.pop(stack_num)\n# param_3 = TripleInOne.peek(stack_num)\n# param_4 = TripleInOne.is_empty(stack_num)\n\n# TripleInOne.init_ will be called before every test case, in which you can do some necessary initializations.", "__typename": "CodeSnippetNode" } ], "stats": "{\"totalAccepted\": \"15.2K\", \"totalSubmission\": \"28.7K\", \"totalAcceptedRaw\": 15198, \"totalSubmissionRaw\": 28661, \"acRate\": \"53.0%\"}", "hints": [ "栈只是一个数据结构，其中最近添加的元素首先被删除。你能用一个数组来模拟单个栈吗？请记住，有很多可能的解法且每个解法都有其利弊。", "我们可以通过将数组的前三分之一分配到第一个栈、第二个三分之一分配到第二个栈、最后的第三个三分之一分配到第三个栈，来模拟数组中的三个栈。然而，实际上某个栈可能比其他的大得多。能更灵活地分配吗？", "如果你想考虑灵活划分，可以移动栈。你能保证使用所有可用的容量吗？", "试着把数组看作是循环的，这样数组的结尾就“环绕”到了数组的开始部分。" ], "solution": null, "status": null, "sampleTestCase": "[\"TripleInOne\", \"push\", \"push\", \"pop\", \"pop\", \"pop\", \"isEmpty\"]\n[[1], [0, 1], [0, 2], [0], [0], [0], [0]]", "metaData": "{\"classname\": \"TripleInOne\", \"maxbytesperline\": 200000, \"systemdesign\": true, \"constructor\": {\"params\": [{\"name\": \"stackSize\", \"type\": \"integer\"}]}, \"methods\": [{\"name\": \"push\", \"params\": [{\"name\": \"stackNum\", \"type\": \"integer\"}, {\"name\": \"value\", \"type\": \"integer\"}], \"return\": {\"type\": \"void\"}}, {\"name\": \"pop\", \"params\": [{\"name\": \"stackNum\", \"type\": \"integer\"}], \"return\": {\"type\": \"integer\"}}, {\"name\": \"peek\", \"params\": [{\"name\": \"stackNum\", \"type\": \"integer\"}], \"return\": {\"type\": \"integer\"}}, {\"name\": \"isEmpty\", \"params\": [{\"name\": \"stackNum\", \"type\": \"integer\"}], \"return\": {\"type\": \"boolean\"}}], \"params\": [{\"name\": \"inputs\", \"type\": \"integer[]\"}, {\"name\": \"inputs\", \"type\": \"integer[]\"}], \"return\": {\"type\": \"list\", \"dealloc\": true}}", "judgerAvailable": true, "judgeType": "large", "mysqlSchemas": [], "enableRunCode": true, "envInfo": "{\"cpp\":[\"C++\",\"

\\u7248\\u672c\\uff1aclang 11<\\/code> \\u91c7\\u7528\\u6700\\u65b0C++ 17\\u6807\\u51c6\\u3002<\\/p>\\r\\n\\r\\n

\\u7f16\\u8bd1\\u65f6\\uff0c\\u5c06\\u4f1a\\u91c7\\u7528-O2<\\/code>\\u7ea7\\u4f18\\u5316\\u3002AddressSanitizer<\\/a> \\u4e5f\\u88ab\\u5f00\\u542f\\u6765\\u68c0\\u6d4bout-of-bounds<\\/code>\\u548cuse-after-free<\\/code>\\u9519\\u8bef\\u3002<\\/p>\\r\\n\\r\\n

\\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\",\"

\\u7248\\u672c\\uff1aOpenJDK 17<\\/code>\\u3002\\u53ef\\u4ee5\\u4f7f\\u7528Java 8\\u7684\\u7279\\u6027\\u4f8b\\u5982\\uff0clambda expressions \\u548c stream API\\u3002<\\/p>\\r\\n\\r\\n

\\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

\\u5305\\u542b Pair \\u7c7b: https:\\/\\/docs.oracle.com\\/javase\\/8\\/javafx\\/api\\/javafx\\/util\\/Pair.html <\\/p>\"],\"python\":[\"Python\",\"

\\u7248\\u672c\\uff1a Python 2.7.12<\\/code><\\/p>\\r\\n\\r\\n

\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u5e38\\u7528\\u5e93\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8 \\u5bfc\\u5165\\uff0c\\u5982\\uff1aarray<\\/a>, bisect<\\/a>, 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

\\u6ce8\\u610f Python 2.7 \\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>\"],\"c\":[\"C\",\"

\\u7248\\u672c\\uff1aGCC 8.2<\\/code>\\uff0c\\u91c7\\u7528GNU99\\u6807\\u51c6\\u3002<\\/p>\\r\\n\\r\\n

\\u7f16\\u8bd1\\u65f6\\uff0c\\u5c06\\u4f1a\\u91c7\\u7528-O1<\\/code>\\u7ea7\\u4f18\\u5316\\u3002 AddressSanitizer<\\/a>\\u4e5f\\u88ab\\u5f00\\u542f\\u6765\\u68c0\\u6d4bout-of-bounds<\\/code>\\u548cuse-after-free<\\/code>\\u9519\\u8bef\\u3002<\\/p>\\r\\n\\r\\n

\\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>\\r\\n\\r\\n

\\u5982\\u60f3\\u4f7f\\u7528\\u54c8\\u5e0c\\u8868\\u8fd0\\u7b97, \\u60a8\\u53ef\\u4ee5\\u4f7f\\u7528 uthash<\\/a>\\u3002 \\\"uthash.h\\\"\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5bfc\\u5165\\u3002\\u8bf7\\u770b\\u5982\\u4e0b\\u793a\\u4f8b:<\\/p>\\r\\n\\r\\n

1. \\u5f80\\u54c8\\u5e0c\\u8868\\u4e2d\\u6dfb\\u52a0\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n

\\r\\nstruct hash_entry {\\r\\n    int id;            \\/* we'll use this field as the key *\\/\\r\\n    char name[10];\\r\\n    UT_hash_handle hh; \\/* makes this structure hashable *\\/\\r\\n};\\r\\n\\r\\nstruct hash_entry *users = NULL;\\r\\n\\r\\nvoid add_user(struct hash_entry *s) {\\r\\n    HASH_ADD_INT(users, id, s);\\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\\r\\n\\r\\n
2. \\u5728\\u54c8\\u5e0c\\u8868\\u4e2d\\u67e5\\u627e\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n
\\r\\nstruct hash_entry *find_user(int user_id) {\\r\\n    struct hash_entry *s;\\r\\n    HASH_FIND_INT(users, &user_id, s);\\r\\n    return s;\\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\\r\\n\\r\\n
3. \\u4ece\\u54c8\\u5e0c\\u8868\\u4e2d\\u5220\\u9664\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n
\\r\\nvoid delete_user(struct hash_entry *user) {\\r\\n    HASH_DEL(users, user);  \\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\"],\"csharp\":[\"C#\",\"
C# 10<\\/a> \\u8fd0\\u884c\\u5728 .NET 6 \\u4e0a<\\/p>\\r\\n\\r\\n
\\u60a8\\u7684\\u4ee3\\u7801\\u5728\\u7f16\\u8bd1\\u65f6\\u9ed8\\u8ba4\\u5f00\\u542f\\u4e86debug\\u6807\\u8bb0(\\/debug:pdbonly<\\/code>)\\u3002<\\/p>\"],\"javascript\":[\"JavaScript\",\"
\\u7248\\u672c\\uff1aNode.js 16.13.2<\\/code><\\/p>\\r\\n\\r\\n
\\u60a8\\u7684\\u4ee3\\u7801\\u5728\\u6267\\u884c\\u65f6\\u5c06\\u5e26\\u4e0a --harmony<\\/code> \\u6807\\u8bb0\\u6765\\u5f00\\u542f \\u65b0\\u7248ES6\\u7279\\u6027<\\/a>\\u3002<\\/p>\\r\\n\\r\\n
lodash.js<\\/a> \\u5e93\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5305\\u542b\\u3002<\\/p>\\r\\n\\r\\n
 \\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528  datastructures-js\\/priority-queue<\\/a> \\u548c  datastructures-js\\/queue<\\/a>\\u3002<\\/p>\"],\"ruby\":[\"Ruby\",\"
\\u4f7f\\u7528Ruby 3.1<\\/code>\\u6267\\u884c<\\/p>\\r\\n\\r\\n
\\u4e00\\u4e9b\\u5e38\\u7528\\u7684\\u6570\\u636e\\u7ed3\\u6784\\u5df2\\u5728 Algorithms \\u6a21\\u5757\\u4e2d\\u63d0\\u4f9b\\uff1ahttps:\\/\\/www.rubydoc.info\\/github\\/kanwei\\/algorithms\\/Algorithms<\\/p>\"],\"swift\":[\"Swift\",\"
\\u7248\\u672c\\uff1aSwift 5.5.2<\\/code><\\/p>\\r\\n\\r\\n
\\u6211\\u4eec\\u901a\\u5e38\\u4fdd\\u8bc1\\u66f4\\u65b0\\u5230 Apple\\u653e\\u51fa\\u7684\\u6700\\u65b0\\u7248Swift<\\/a>\\u3002\\u5982\\u679c\\u60a8\\u53d1\\u73b0Swift\\u4e0d\\u662f\\u6700\\u65b0\\u7248\\u7684\\uff0c\\u8bf7\\u8054\\u7cfb\\u6211\\u4eec\\uff01\\u6211\\u4eec\\u5c06\\u5c3d\\u5feb\\u66f4\\u65b0\\u3002<\\/p>\"],\"golang\":[\"Go\",\"
\\u7248\\u672c\\uff1aGo 1.17<\\/code><\\/p>\\r\\n\\r\\n
\\u652f\\u6301 https:\\/\\/godoc.org\\/github.com\\/emirpasic\\/gods<\\/a> \\u7b2c\\u4e09\\u65b9\\u5e93\\u3002<\\/p>\"],\"python3\":[\"Python3\",\"
\\u7248\\u672c\\uff1aPython 3.10<\\/code><\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u5e38\\u7528\\u5e93\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8 \\u5bfc\\u5165\\uff0c\\u5982array<\\/a>, bisect<\\/a>, 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
\\u5982\\u9700\\u4f7f\\u7528 Map\\/TreeMap \\u6570\\u636e\\u7ed3\\u6784\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 sortedcontainers<\\/a> \\u5e93\\u3002<\\/p>\"],\"scala\":[\"Scala\",\"
\\u7248\\u672c\\uff1aScala 2.13<\\/code><\\/p>\"],\"kotlin\":[\"Kotlin\",\"
\\u7248\\u672c\\uff1aKotlin 1.3.10<\\/code><\\/p>\"],\"rust\":[\"Rust\",\"
\\u7248\\u672c\\uff1arust 1.58.1<\\/code><\\/p>\\r\\n\\r\\n
\\u652f\\u6301 crates.io \\u7684 rand<\\/a><\\/p>\"],\"php\":[\"PHP\",\"
PHP 8.1<\\/code>.<\\/p>\\r\\n\\r\\n
With bcmath module.<\\/p>\"],\"typescript\":[\"TypeScript\",\"
TypeScript 4.5.4<\\/p>\\r\\n\\r\\n
Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2020<\\/p>\"],\"racket\":[\"Racket\",\"
Racket CS<\\/a> v8.3<\\/p>\\r\\n\\r\\n
\\u4f7f\\u7528 #lang racket<\\/p>\\r\\n\\r\\n
\\u5df2\\u9884\\u5148 (require data\\/gvector data\\/queue data\\/order data\\/heap). \\u82e5\\u9700\\u4f7f\\u7528\\u5176\\u5b83\\u6570\\u636e\\u7ed3\\u6784\\uff0c\\u53ef\\u81ea\\u884c require\\u3002<\\/p>\"],\"erlang\":[\"Erlang\",\"Erlang\\/OTP 24.2\"],\"elixir\":[\"Elixir\",\"Elixir 1.13.0 with Erlang\\/OTP 24.2\"]}",
            "book": {
                "id": "2",
                "bookName": "《程序员面试金典（第 6 版）》",
                "pressName": "图灵公司",
                "source": "《程序员面试金典（第 6 版）》独家授权",
                "shortDescription": "英文版：Cracking the Coding Interview，源自硅谷程序员的面试红宝书",
                "fullDescription": "本书是原谷歌资深面试官的经验之作，帮助了许多想要加入脸书、苹果、谷歌等 IT 名企的求职者拿到 Dream offer。本专题的 100+ 编程面试题是在原书基础上精心挑选出来的，帮助你轻松应战 IT 名企技术面试。",
                "bookImgUrl": "https://assets.leetcode-cn.com/aliyun-lc-upload/uploads/2019/09/30/book_2.jpg",
                "pressImgUrl": "https://assets.leetcode-cn.com/aliyun-lc-upload/uploads/2020/02/11/logo20190828-02.png",
                "productUrl": "",
                "__typename": "CategoryInfoNode"
            },
            "isSubscribed": false,
            "isDailyQuestion": false,
            "dailyRecordStatus": null,
            "editorType": "CKEDITOR",
            "ugcQuestionId": null,
            "style": "LEETCODE",
            "exampleTestcases": "",
            "__typename": "QuestionNode"
        }
    }
}