Timeline for Finding strings in a matrix
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 24, 2017 at 22:55 | comment | added | yuri | Also you should return false, as the word was not found. I'm unsure what you mean by this as that is literally the end condition. | |
| May 24, 2017 at 15:09 | history | edited | Toby Speight | CC BY-SA 3.0 | Inserted a couple of omitted words; minor spelling/grammar/formatting tweaks |
| May 24, 2017 at 15:04 | comment | added | Toby Speight | Alternative idiomatic approach to operator<, reducing the complexity, is to return std::tie(x,y) < std::tie(rhs.x, rhs.y);. | |
| May 24, 2017 at 14:17 | history | edited | miscco | CC BY-SA 3.0 | Add comments for revised edition |
| May 24, 2017 at 12:18 | comment | added | yuri | Putting aside the graph based approach for later I updated the current solution with your advice in mind. | |
| May 24, 2017 at 9:42 | history | answered | miscco | CC BY-SA 3.0 |