数据结构64-双向链表indexOf方法代码-阿里云开发者社区

数据结构64-双向链表indexOf方法代码

2023-02-11 50

版权

本文内容由阿里云实名注册用户自发贡献，版权归原作者所有，阿里云开发者社区不拥有其著作权，亦不承担相应法律责任。具体规则请查看《阿里云开发者社区用户服务协议》和《阿里云开发者社区知识产权保护指引》。如果您发现本社区中有涉嫌抄袭的内容，填写侵权投诉表单进行举报，一经查实，本社区将立刻删除涉嫌侵权内容。

简介： 数据结构64-双向链表indexOf方法代码

<!DOCTYPE html>
<html lang="en">
  <head>
    <meta charset="UTF-8" />
    <meta http-equiv="X-UA-Compatible" content="IE=edge" />
    <meta name="viewport" content="width=device-width, initial-scale=1.0" />
    <title>双向链表</title>
  </head>
  <body>
    <script>
      function DoubleList() {
        this.head = null;
        this.tail = null;
        this.length = 0;
        function Node(data) {
          this.data = data;
          this.prev = null;
          this.next = null;
        }
        DoubleList.prototype.append = function (data) {
          var newNode = new Node(data);
          if (this.length == 0) {
            this.head = newNode;
          } else {
            var current = this.head;
            while (current.next) {
              current = current.next;
            }
            current.next = newNode;
          }
          this.length += 1;
        };
        DoubleList.prototype.backwardString = function (data) {
          //定义变量
          var current = this.head;
          var resultString = "";
          while (current) {
            resultString += current.data + " ";
            current = current.next;
          }
          return resultString;
        };
        DoubleList.prototype.forwardString = function (data) {
          //定义变量
          var current = this.tail;
          var resultString = "";
          while (current) {
            resultString += current.data + " ";
            current = current.prev;
          }
          return resultString;
        };
        DoubleList.prototype.toString = function (data) {
          //定义变量
          return this.backwardString();
        };
        DoubleList.prototype.insert = function (position, data) {
          if (position < 0 || position > this.length) return false;
          var newNode = new Node(data);
          if (this.length == 0) {
            this.head = newNode;
            this.tail = newNode;
          } else {
            if (position == 0) {
              this.head.prev = newNode;
              newNode.next = this.head;
              this.head = newNode;
            } else if(position==this.length) {
                newNode.prev=this.tail
                this.tail.next=newNode
                this.tail=newNode
            }else{
                var current=this.head
                var index=0
                while(index++<position){
                    current=current.next
                }
                newNode.next=current
                newNode.prev=current.prev
                current.prev.next=newNode
                current.prev=newNode
            }
          }
          this.length+=1
          return true
        };
        DoubleList.prototype.get = function (position, data) {
            if (position < 0 || position > this.length) return null;
            //获取元素
            var current=this.head
            var index=0
            while(index++<position){
                current=current.next
            }
            return current.data
        }
        DoubleList.prototype.indexOf = function (data) {
            var current = this.head;
          var index = 0;
          //开始查找
          while (current) {
            if (current.data == data) {
              return index;
            }
            current = current.next;
            index += 1;
          }
          return -1;
        }
      }
    </script>
  </body>
</html>

数据结构64-双向链表indexOf方法代码

热门文章

最新文章

相关课程

相关电子书

热门

活动广场

任务中心

开发者评测

高校计划

乘风者计划

训练营

阿里云MVP

话题

直播

下载

镜像站

技术资料

插件

数据结构64-双向链表indexOf方法代码

热门文章

最新文章

相关课程

相关电子书