gaspersic/freeCodeCamp
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

fix: added more values to list to improve tests (#40256)

Browse Source
This commit is contained in:
Randell Dawson
2020-11-18 01:38:26 -08:00
committed by GitHub
parent aebe53312c
commit 2c9a900353
1 changed files with 2 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
curriculum/challenges/english/10-coding-interview-prep/data-structures/reverse-a-doubly-linked-list.md
View File

@ -27,9 +27,9 @@ tests:
- text: Reversing an empty list should return null.
testString: assert((function() { var test = false; if (typeof DoublyLinkedList !== 'undefined') { test = new DoublyLinkedList() }; return (test.reverse() == null); })());
- text: The reverse method should reverse the list.
testString: assert((function() { var test = false; if (typeof DoublyLinkedList !== 'undefined') { test = new DoublyLinkedList() }; test.add(58); test.add(61); test.add(32); test.reverse(); return (test.print().join('') == '326158'); })());
testString: assert((function() { var test = false; if (typeof DoublyLinkedList !== 'undefined') { test = new DoublyLinkedList() }; test.add(58); test.add(61); test.add(32); test.add(95); test.add(41); test.reverse(); return (test.print().join('') == '4195326158'); })());
- text: The next and previous references should be correctly maintained when a list is reversed.
testString: assert((function() { var test = false; if (typeof DoublyLinkedList !== 'undefined') { test = new DoublyLinkedList() }; test.add(11); test.add(22); test.add(33); test.reverse(); return (test.printReverse().join('') == '112233'); })());
testString: assert((function() { var test = false; if (typeof DoublyLinkedList !== 'undefined') { test = new DoublyLinkedList() }; test.add(11); test.add(22); test.add(33); test.add(44); test.add(55); test.reverse(); return (test.printReverse().join('') == '1122334455'); })());
```