查找字符串中连续不重复最长字符串和长度的方法

查找字符串中连续不重复最长字符串和长度的方法（js实现）
参考: https://zhuanlan.zhihu.com/p/161705249

 class Node {
        constructor(v) {
          this.v = v;
          this.next = null;
          this.prev = null;
        }

        setNext(node) {
          this.next = node;
        }

        getNext() {
          return this.next;
        }

        setPrev(node) {
          this.prev = node;
        }

        getPrev() {
          return this.prev;
        }

        getValue() {
          return this.v;
        }
      }

      class List {
        constructor() {
          this.head = new Node(null);
          this.current = this.head;
        }

        add(v) {
          let node = new Node(v);
          this.current.setNext(node);
          node.setPrev(this.current);
          this.current = node;
        }

        has(v) {
          let find = false;
          let currentNode = this.head;
          while (currentNode.getNext()) {
            if (currentNode.getValue() == v) {
              find = true;
              break;
            } else {
              currentNode = currentNode.getNext();
            }
          }
          return find;
        }

        // 删除第一个出现的Node
        delete(v) {
          let distNode = null;
          let currentNode = this.head;
          while (currentNode.getNext()) {
            if (currentNode.getValue() == v) {
              distNode = currentNode;
              break;
            } else {
              currentNode = currentNode.getNext();
            }
          }
          distNode.getNext().setPrev(distNode.getPrev());
          distNode.getPrev().setNext(distNode.getNext());
        }

        getNode(v) {
          let findNode = null;
          let currentNode = this.head;
          while (currentNode.getNext()) {
            if (currentNode.getValue() == v) {
              findNode = currentNode;
              break;
            } else {
              currentNode = currentNode.getNext();
            }
          }
          return findNode;
        }

        getAllValue() {
          let ret = "";
          let currentNode = this.head.getNext();
          if (!currentNode) return null;
          while (true) {
            if (!currentNode.getNext()) {
              ret += currentNode.getValue();
              break;
            }
            ret += currentNode.getValue();
            currentNode = currentNode.getNext();
          }
          return ret;
        }
      }

      // 取最长不重复字符串
      function getMaxLenAndNoRepeat() {
        let list = new List();
        let retMap = new Map();
        // https://zhuanlan.zhihu.com/p/161705249

        for (let i = 0; i < str.length; i++) {
          retMap.set(i, list.getAllValue());
          // list.add(str[i]);
          let s = str[i];
          if (!list.has(s)) {
            list.add(s);
          } else {
            let current = list.getNode(s);
            while (current.getPrev()) {
              list.delete(current.getValue());
              current = current.getPrev();
            }
            list.add(s);
          }
        }
        // console.error(retMap);
        let maxLen = 0;
        let maxLenIndex = -1;
        for (let i of retMap.keys()) {
          // console.error(i);
          let ret = retMap.get(i);
          if (ret && ret.length > maxLen) {
            maxLenIndex = i;
            maxLen = ret.length;
          }
        }

        console.error("执行过程:", retMap);
        return retMap.get(maxLenIndex);
      }

      let str = "abacbefkb";
      let ret = getMaxLenAndNoRepeat(str);
      console.error("input:", str); // input: abacbefkb
      console.error("out:", ret); // out: acbefk