廢話少說,上代碼(talk is easy,show me the code):
<?php
class SimpleStack {
private $_stack = [];
private $_size = [];
public function __construct($size = 10)
{
$this->_size = $size;
}
// 獲取棧頂元素
public function pop()
{
// 空棧
if (count($this->_stack) == 0) {
return false;
}
return array_pop($this->_stack);
}
// 推送元素到棧頂
public function push($value)
{
// 滿棧
if (count($this->_stack) == $this->_size) {
return false;
}
array_push($this->_stack, $value);
return true;
}
public function isEmpty()
{
// 是否是空棧
return current($this->_stack) == false;
}
public function size()
{
return count($this->_stack);
}
}
$stack = new SimpleStack(15);
var_dump($stack->isEmpty()); # true
$stack->push(111);
$stack->push('學院君');
var_dump($stack->pop()); # 學院君
var_dump(count($stack->size())); # 1
php系列----->通過PHP數組實現簡單的順序棧
發表評論
所有評論
還沒有人評論,想成為第一個評論的人麼? 請在上方評論欄輸入並且點擊發布.