<?php
class Stack{
  const MAXSIZE = 4;// 棧最大容量
  private $top = -1;
  private $stack = array();// 利用數(shù)組存儲數(shù)據(jù)
  public function __construct(){
    $this->stack = array();
  }
  // 入棧
  public function push($ele){
    if ($this->top >= self::MAXSIZE-1){
      echo 'stack is full...';
      return false;
    }
    $this->stack[++$this->top] = $ele;// 此處必須是++i，先計算再使用
  }
  // 出棧，返回出棧元素
  public function pop(){
    if ($this->top == -1){
      echo 'stack is empty...';
      return false;
    }
    $ele = $this->stack[$this->top];
    unset($this->stack[$this->top--]);// 此處必須是i--，先使用再計算（注意出棧和入棧的區(qū)別）
    return $ele;
  }
  // 遍歷棧
  public function show(){
    if ($this->top == -1){
      echo 'stack is empty...';
      return false;
    }
    for($i=$this->top; $i>-1; $i--){
      echo $this->stack[$i].'<br/>';
    }
  }
}
$stack = new Stack;
$stack->push(1);
$stack->push(2);
$stack->push(3);
$stack->push(4);
//print_r($stack);
$stack->show();
$a = $stack->pop();
$a = $stack->pop();
$a = $stack->pop();
$stack->show();

4
3
2
1
1