add 0232

Author: lily-lee

algorithms/0232/README.md

@@ -0,0 +1,59 @@
+package _0232
+
+type MyQueue struct {
+	in  []int
+	out []int
+}
+
+/** Initialize your data structure here. */
+func Constructor() MyQueue {
+	return MyQueue{
+		in:  make([]int, 0),
+		out: make([]int, 0),
+	}
+}
+
+/** Push element x to the back of queue. */
+func (this *MyQueue) Push(x int) {
+	this.in = append(this.in, x)
+}
+
+/** Removes the element from in front of queue and returns that element. */
+func (this *MyQueue) Pop() int {
+	if len(this.out) > 0 {
+		x := this.out[len(this.out)-1]
+		this.out = this.out[0 : len(this.out)-1]
+		return x
+	}
+	this.in2out()
+	return this.Pop()
+}
+func (this *MyQueue) in2out() {
+	for len(this.in) > 0 {
+		this.out = append(this.out, this.in[len(this.in)-1])
+		this.in = this.in[:len(this.in)-1]
+	}
+}
+
+/** Get the front element. */
+func (this *MyQueue) Peek() int {
+	if len(this.out) > 0 {
+		return this.out[len(this.out)-1]
+	}
+	this.in2out()
+	return this.Peek()
+}
+
+/** Returns whether the queue is empty. */
+func (this *MyQueue) Empty() bool {
+	return len(this.out) == 0 && len(this.in) == 0
+}
+
+/**
+ * Your MyQueue object will be instantiated and called as such:
+ * obj := Constructor();
+ * obj.Push(x);
+ * param_2 := obj.Pop();
+ * param_3 := obj.Peek();
+ * param_4 := obj.Empty();
+ */