php实现顺序线性表

什么是线性顺序表？

线性顺序表是指按照顺序在内存进行存储，除起始和结尾以外都是一一连接的(一般都是用一维数组的形式表现)。

（免费学习视频教程分享：php视频教程）

实例代码如下所示：

seqArr = $arr;
    $this->length = count($arr);
  }
  
  public function GetElem($index) {
    if (($this->length) == 0 || $index < 0 || ($index > $this->length)) {
      return "Error";
    }
    return $this->seqArr[$index - 1];
  }
  
  public function ListLength() {
    return $this->length;
  }
  
  public function LocateElem($elem) {
    for ($i = 0; $i < ($this->length); $i++) {
      if (($this->seqArr[$i]) == $elem) {
 return $i + 1;
      }
    }
  }
  
  public function PriorElem($elem) {
    for ($i = 0; $i < ($this->length); $i++) {
      if (($this->seqArr[$i]) == $elem) {
 if ($i == 0) {
   return "Error (is null) ";
 } else {
   return $this->seqArr[$i - 1];
 }
      }
    }
  }
  
  public function NextElem($elem) {
    for ($i = 0; $i < ($this->length); $i++) {
      if (($this->seqArr[$i]) == $elem) {
 return $this->seqArr[$i + 1];
      }
    }
  }
  
  public function ListInsert($index, $elem) {
    if (($this->length) == 0 || $index < 0 || $index > ($this->length)) {
      return "Error";
    }
    for ($i = $index; $i < ($this->length); $i++) {
      $this->seqArr[$i + 1] = $this->seqArr[$i];
    }
    $this->seqArr[$index] = $elem;
    $this->length = $this->length + 1;
    return $this->seqArr;
  }
  
  public function ListDelete($index) {
    if (($this->length) == 0 || $index < 0 || $index > ($this->length - 1)) {
      return "Error";
    }
    unset($this->seqArr[$index]);
    $this->length--;
    return $this->seqArr;
  }
}
?>

相关文章教程分享：php教程

以上就是php实现顺序线性表的详细内容，更多请关注考高分网其它相关文章！