René's URL Explorer Experiment

{"@context":"https://schema.org","@type":"Code","url":"https://leetcodejavascript.com/solutions/implement-stack-using-queues","name":"#225 - Implement Stack using Queues - LeetCode JavaScript Solutions","description":"Implement a last-in-first-out (LIFO) stack using only two queues. The implemented stack should support all the functions of a normal stack (...","programmingLanguage":"JavaScript","codeRepository":"https://github.com/JoshCrozier/leetcode-javascript","codeSampleType":"JavaScript","text":"var MyStack = function() {\n this.data = [];\n};\n\n/**\n * @param {number} x\n * @return {void}\n */\nMyStack.prototype.push = function(x) {\n this.data.push(x);\n};\n\n/**\n * @return {number}\n */\nMyStack.prototype.pop = function() {\n return this.data.pop();\n};\n\n/**\n * @return {number}\n */\nMyStack.prototype.top = function() {\n return this.data[this.data.length - 1];\n};\n\n/**\n * @return {boolean}\n */\nMyStack.prototype.empty = function() {\n return !this.data.length;\n};\n\n/**\n * Your MyStack object will be instantiated and called as such:\n * var obj = new MyStack()\n * obj.push(x)\n * var param_2 = obj.pop()\n * var param_3 = obj.top()\n * var param_4 = obj.empty()\n */","keywords":"LeetCode 225, #225 - Implement Stack using Queues, Easy, JavaScript solution","learningResourceType":"Code","isAccessibleForFree":true,"educationalLevel":"intermediate","interactivityType":"mixed"}