摘要: ``` stack) stackMaxTop == $this->Top) { return "栈已满"; } array_push($this->stack,$value); ++$this->Top; return '栈顶的值'.$this->Top; } #出栈 public function pop() { if (!$this->stack_is_nul... 阅读全文
posted @ 2019-12-04 17:30 青柚 阅读(215) 评论(0) 推荐(0) 编辑