implement-queue-using-stacks.rs

#![allow(dead_code, unused, unused_variables)]

fnmain(){}

structSolution;

/**
 * Your MyQueue object will be instantiated and called as such:
 * let obj = MyQueue::new();
 * obj.push(x);
 * let ret_2: i32 = obj.pop();
 * let ret_3: i32 = obj.peek();
 * let ret_4: bool = obj.empty();
 */
structMyQueue{
data:Vec<i32>,
}

/**
 * `&self` means the method takes an immutable reference.
 * If you need a mutable reference, change it to `&mut self` instead.
 */
implMyQueue{
/** Initialize your data structure here. */
fnnew() -> Self{
Self{data:vec![]}
}

/** Push element x to the back of queue. */
fnpush(&mutself,x:i32){
self.data.push(x);
}

/** Removes the element from in front of queue and returns that element. */
fnpop(&mutself) -> i32{
let data = self.peek();
self.data = self.data[1..].to_vec();
 data
}

/** Get the front element. */
fnpeek(&mutself) -> i32{
let data = self.data[0];
 data
}

/** Returns whether the queue is empty. */
fnempty(&self) -> bool{
self.data.len() == 0
}
}