• [TS] Implement a doubly linked list in TypeScript


    In a doubly linked list each node in the list stores the contents of the node and a pointer or reference to the next and the previous nodes in the list. It is one of the simplest way to store a collection of items.

    In this lesson we cover how to create a doubly linked list data structure and how to use its strengths to implement an O(1) FIFO queue + O(1) LIFO stack. We also demonstrate why one would use it over a singly linked list. We also cover how to approach authoring such data structures.

     The reason for use double linked list is that we can do LIFO opreation in O(1), in Single linked List, it requires O(n), because you need to go thought from the head, in order to know what will be the next tail item for new linked list. 

    /**
     * Linked list node
     */
    export interface DoublyLinkedListNode<T> {
      value: T
      next?: DoublyLinkedListNode<T>
      prev?: DoublyLinkedListNode<T>
    }
    
    /**
     * Linked list for items of type T
     */
    export class DoublyLinkedList<T> {
      public head?: DoublyLinkedListNode<T> = undefined;
      public tail?: DoublyLinkedListNode<T> = undefined;
    
      /**
       * Adds an item in O(1)
       **/
      add(value: T) {
        const node: DoublyLinkedListNode<T> = {
          value,
          next: undefined,
          prev: undefined,
        }
        if (!this.head) {
          this.head = node;
        }
        if (this.tail) {
          this.tail.next = node;
          node.prev = this.tail;
        }
        this.tail = node;
      }
    
      /**
       * FIFO removal in O(1)
       */
      dequeue(): T | undefined {
        if (this.head) {
          const value = this.head.value;
          this.head = this.head.next;
          if (!this.head) {
            this.tail = undefined;
          }
          else {
            this.head.prev = undefined;
          }
          return value;
        }
      }
    
      /**
       * LIFO removal in O(1)
       */
      pop(): T | undefined {
        if (this.tail) {
          const value = this.tail.value;
          this.tail = this.tail.prev;
          if (!this.tail) {
            this.head = undefined;
          }
          else {
            this.tail.next = undefined;
          }
          return value;
        }
      }
    
      /**
       * Returns an iterator over the values
       */
      *values() {
        let current = this.head;
        while (current) {
          yield current.value;
          current = current.next;
        }
      }
    }
    import { DoublyLinkedList } from './doublyLinkedList';
    
    test('basic', () => {
      const list = new DoublyLinkedList<number>();
      list.add(1);
      list.add(10);
      list.add(5);
      expect(Array.from(list.values())).toMatchObject([1, 10, 5]);
      expect(list.dequeue()).toBe(1);
      expect(Array.from(list.values())).toMatchObject([10, 5]);
      expect(list.dequeue()).toBe(10);
      expect(list.dequeue()).toBe(5);
      expect(list.dequeue()).toBe(undefined);
      expect(Array.from(list.values())).toMatchObject([]);
      list.add(5);
      list.add(10);
      list.add(1);
      expect(Array.from(list.values())).toMatchObject([5, 10, 1]);
      expect(list.pop()).toBe(1);
      expect(list.dequeue()).toBe(5);
      expect(list.pop()).toBe(10);
      expect(list.pop()).toBe(undefined);
      expect(list.dequeue()).toBe(undefined);
      expect(Array.from(list.values())).toMatchObject([]);
    });
  • 相关阅读:
    A Deep Dive Into Draggable and DragTarget in Flutter
    使用joda-time工具类 计算时间相差多少 天,小时,分钟,秒
    XmlDocument.load 读文件报异常:文件正被其它线程使用,解决方法
    拼多多是怎么骗你的?
    东北话中的满语
    唐郑国公魏征金口“斩龙台”梦斩泾河黄龙的传说
    Asp.Net Form表单控件的回车默认事件
    UpdatePanel 控件,客户端事件生命周期踩坑
    Javascript 严格模式(strict mode)详解
    代数、几何、分析 各自的范畴
  • 原文地址:https://www.cnblogs.com/Answer1215/p/7623103.html
Copyright © 2020-2023  润新知