algorithm_rust 0.6.0

///栈
/// #Examples
///```
///use algori::structure::Stack;
///let mut  a: Stack<i32> = Stack::new(); //建栈
///for i in 0..=10 {
///a.push(i); //压入元素
///}
///for i in 0..=10 {a.pop();} //弹出元素
///assert_eq!(a.is_empty(),true)
///```
pub struct Stack<T> {
    data: Vec<T>,
}

impl<T> Stack<T> {
    ///建栈
    pub fn new() -> Stack<T> {
        Stack { data: Vec::new() }
    }
    ///推入栈
    pub fn push(&mut self, value: T) {
        self.data.push(value);
    }
    ///弹出栈
    pub fn pop(&mut self) -> Option<T> {
        self.data.pop()
    }
    ///返回最后一个元素
    pub fn peek(&self) -> Option<&T> {
        self.data.last()
    }
    ///判断是否为空
    pub fn is_empty(&self) -> bool {
        self.data.is_empty()
    }
}