PHP算法每日一练 堆栈

<?php
/**堆栈 使用数组模拟入栈和出栈*/
class myStark{
    public $top = -1;
    public $maxStark = 5;
    public $stark = array();
    public function __construct(){

    }
    /*入栈*/
    public function push($val){
        if($this->top > $this->maxStark - 1){
            return false;
        }
        $this->top ++;
        $this->stark[$this->top] = $val;
    }
    /*出栈*/
    public function pop(){
        if($this->top <= -1){
            return false;
        }
        $return = $this->stark[$this->top];
        $this->top -- ;
        return $return;
    }
    /*打印*/
    public function show(){
        for($i = $this->top;$i>-1;$i--){
            echo 'stack['.$i.']='.$this->stark[$i].'<br />';
        }
    }
}
$stack = new myStark();
$stack->push('香蕉');
$stack->push('苹果');
$stack->push('葡萄');
$stack->push('梨子');
$stack->push('草莓');
$stack->show();
$val = $stack->pop();
echo $val.'出栈了！'.
$stack->show();
?>

源代码下载：Stark_1203.zip