数据结构-线性表 5.栈实现(php)

1、栈实现

class OrderStack
{
    //用默认值直接初始化栈了，也可用构造方法初始化栈
    private $top = -1;
    private $maxSize = 3;
    private $stack = array();

    //入栈
    public function push($elem){
        if($this->top >= $this->maxSize-1){
            echo "栈已满！<br/>";
            return;
        }
        $this->top++;
        $this->stack[$this->top] = $elem;
    }
    //出栈
    public function pop(){
        if($this->top == -1){
            echo "栈是空的！";
            return ;
        }
        $elem = $this->stack[$this->top];
        unset($this->stack[$this->top]);
        $this->top--;
        return $elem;
    }
    //打印栈
    public function show(){
        for($i=$this->top;$i>=0;$i--){
            echo $this->stack[$i]." ";
        }
        echo "<br/>";
    }
}