That's all well for the speed, but let's check correctness:
Testing string: fox comes and fox goes into forest
Holli : fox comes and the fox goes into forest Roy : fox comes and the fox goes into forest Borisz : fox comes and the fox goes into forest shltn : fox comes and the fox goes into forest
Every solution got that one right.
Testing string: fox comes fox walks and fox goes into forest
Holli : fox comes fox walks and the fox goes into forest Roy : fox comes fox walks and the fox goes into forest Borisz : fox comes fox walks and the fox goes into forest shltn : fox comes the fox walks and fox goes into forest
Three foxes trip up shltn.
Testing string: pig comes and fox goes into forest
Holli : pig comes and fox goes into forest Roy : pig comes and the fox goes into forest Borisz : pig comes and the fox goes into forest shltn : pig comes and fox goes into forest
And just one fox trips up both Holli and shltn
So I'm just going to pretend I have judging power and disqualify Holli's and shltn's entries, which makes Roy Jonhson the new winner. :)
In reply to Re^3: regexp find last word
by Crackers2
in thread regexp find last word
by Murcia
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |