René's URL Explorer Experiment

{"@context":"https://schema.org","@type":"Code","url":"https://leetcodejavascript.com/solutions/min-stack","name":"#155 - Min Stack - LeetCode JavaScript Solutions","description":"Design a stack that supports push, pop, top, and retrieving the minimum element in constant time. Implement the MinStack class: MinStack() ...","programmingLanguage":"JavaScript","codeRepository":"https://github.com/JoshCrozier/leetcode-javascript","codeSampleType":"JavaScript","text":"var MinStack = function() {\n this.stack = [];\n};\n\n/**\n * @param {number} val\n * @return {void}\n */\nMinStack.prototype.push = function(val) {\n this.stack.push({ val, min: this.stack.length ? Math.min(val, this.getMin()) : val });\n};\n\n/**\n * @return {void}\n */\nMinStack.prototype.pop = function() {\n this.stack.pop();\n};\n\n/**\n * @return {number}\n */\nMinStack.prototype.top = function() {\n return this.stack[this.stack.length - 1].val;\n};\n\n/**\n * @return {number}\n */\nMinStack.prototype.getMin = function() {\n return this.stack.length ? this.stack[this.stack.length - 1].min : 0;\n};","keywords":"LeetCode 155, #155 - Min Stack, Medium, JavaScript solution","learningResourceType":"Code","isAccessibleForFree":true,"educationalLevel":"intermediate","interactivityType":"mixed"}