(queue, s, wordSet, seen)
| 162 | }; |
| 163 | |
| 164 | const bfs = (queue, s, wordSet, seen) => { |
| 165 | while (!queue.isEmpty()) { |
| 166 | for (let level = queue.size() - 1; 0 <= level; level--) { |
| 167 | /* Time O(N) */ |
| 168 | if (canWordBreak(queue, s, wordSet, seen)) |
| 169 | return true; /* Time O(N * N) | Space O(N + WIDTH) */ |
| 170 | } |
| 171 | } |
| 172 | |
| 173 | return false; |
| 174 | }; |
| 175 | |
| 176 | var canWordBreak = (queue, s, wordSet, seen) => { |
| 177 | const start = queue.dequeue(); |
no test coverage detected