Runtime: 1 ms (Top 81.11%) | Memory: 2.10 MB (Top 22.78%)

Author: AnasImloul

scripts/algorithms/I/Implement Stack using Queues/Implement Stack using Queues.go

@@ -0,0 +1,31 @@
+// Runtime: 1 ms (Top 81.11%) | Memory: 2.10 MB (Top 22.78%)
+
+type MyStack struct {
+    q []int
+}
+
+func Constructor() MyStack {
+    return MyStack{}
+}
+
+func (this *MyStack) Push(x int) {
+    this.q = append(this.q, x)
+    for i := 0; i < len(this.q)-1; i++ {
+        this.q = append(this.q, this.q[0])
+        this.q = this.q[1:]
+    }
+}
+
+func (this *MyStack) Pop() int {
+    val := this.q[0]
+    this.q = this.q[1:]
+    return val
+}
+
+func (this *MyStack) Top() int {
+    return this.q[0]
+}
+
+func (this *MyStack) Empty() bool {
+    return len(this.q) == 0
+}