Commite220450

committed

Code style fixes.

1 parentde1cc0b commite220450Copy full SHA for e220450

File tree

-6

lines changed

-6

lines changed

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -7,7 +7,7 @@ The task is to traverse the given linked list in straight order.`
`7`	`7`
`8`	`8`	`For example for the following linked list:`
`9`	`9`
`10`		`-![](https://upload.wikimedia.org/wikipedia/commons/6/6d/Singly-linked-list.svg)`
	`10`	`+![Singly linked list](https://upload.wikimedia.org/wikipedia/commons/6/6d/Singly-linked-list.svg)`
`11`	`11`
`12`	`12`	`The order of traversal should be:`
`13`	`13`

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -4,7 +4,7 @@`
`4`	`4`
`5`	`5`	`Например, для следующего связного списка:`
`6`	`6`
`7`		`-![](https://upload.wikimedia.org/wikipedia/commons/6/6d/Singly-linked-list.svg)`
	`7`	`+![Singly linked list](https://upload.wikimedia.org/wikipedia/commons/6/6d/Singly-linked-list.svg)`
`8`	`8`
`9`	`9`	`Порядок обхода будет такой:`
`10`	`10`

Lines changed: 2 additions & 4 deletions

Original file line number	Diff line number	Diff line change
`@@ -227,20 +227,18 @@ describe('LinkedList', () => {`
`227`	`227`	`letnode=linkedList.find({value:3});`
`228`	`228`	`expect(node.value).toBe(4);`
`229`	`229`
`230`		`-node=linkedList.find({callback:value=>value<3});`
	`230`	`+node=linkedList.find({callback:(value)=>value<3});`
`231`	`231`	`expect(node.value).toBe(1);`
`232`	`232`	`});`
`233`	`233`
`234`	`234`	`it('should convert to array',()=>{`
`235`	`235`	`constlinkedList=newLinkedList();`
`236`		`-`
`237`	`236`	`linkedList.append(1);`
`238`	`237`	`linkedList.append(2);`
`239`	`238`	`linkedList.append(3);`
`240`		`-`
`241`	`239`	`expect(linkedList.toArray().join(',')).toBe('1,2,3');`
`242`	`240`	`});`
`243`		`-`
	`241`	`+`
`244`	`242`	`it('should reverse linked list',()=>{`
`245`	`243`	`constlinkedList=newLinkedList();`
`246`	`244`

Comments

(0)