本文共 779 字，大约阅读时间需要 2 分钟。

   top >= $this->maxSize-1){              echo "栈已满！
";              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 "
";      }  }    $stack = new Stack();  $stack->push(1);  $stack->push(2);  $stack->push(3);  $stack->push(4);   $stack->show();  $stack->pop();  $stack->pop();  $stack->pop();  $stack->show();

转载地址：http://nwcrj.baihongyu.com/