some mistakes in delete method and time comlexity (trekhleb#322)

Author: linghuam

src/data-structures/doubly-linked-list/README.md

@@ -64,7 +64,7 @@ Remove(head, value)
     return true
   end if
   n ← head.next
-  while n = ø and value = n.value
+  while n = ø and value !== n.value
     n ← n.next
   end while
   if n = tail
@@ -100,7 +100,7 @@ end Reverse Traversal
 
 | Access    | Search    | Insertion | Deletion  |
 | :-------: | :-------: | :-------: | :-------: |
-| O(n)      | O(n)      | O(1)      | O(1)      |
+| O(n)      | O(n)      | O(1)      | O(n)      |
 
 ### Space Complexity