#12 Task. Sergey Starushkin - #818
Conversation
vramaniuk
left a comment
vramaniuk
left a comment
There was a problem hiding this comment.
Please, privide the direct link to your task success travis build
I'll mark the PR as "Draft", please click "ready for review" when it will be finished. Thank you!
| let save = data[current.y][current.x]; | ||
| data[current.y][current.x] = ""; | ||
|
|
||
| if (step == search.length) |
There was a problem hiding this comment.
"operator === is always preferable
sometimes ''==' may cause an error
(check at console :
'0' == 0
and '0' === 0)"
| let newX = current.x + steps[i][0], | ||
| newY = current.y + steps[i][1]; | ||
|
|
||
| if (data[newY][newX] == search[step]) { |
There was a problem hiding this comment.
operator === is always preferable
|
|
||
| for (let i = 1; i < m; i++) { | ||
| for (let j = 1; j < n; j++) | ||
| if (data[i][j] == search[0]) { |
There was a problem hiding this comment.
operator === is always preferable
| while (stack.length) { | ||
| let item = stack.pop(); | ||
|
|
||
| if (item.string.length == chars.length) { |
There was a problem hiding this comment.
operator === is always preferable
| throw new Error('Not implemented'); | ||
| let maximums = quotes | ||
| .reduceRight((prev, curr) => { | ||
| if (prev.length == 0) |
There was a problem hiding this comment.
operator === is always preferable
|
Dirty PR. Please, see notes for tasks 1-4 And implement previous notes (strikt equality and unequality) I'll mark the PR as "Draft", please click "ready for review" when it will be finished. Thank you! |
3 participants
No description provided.