Task
Define a word as a sequence of consecutive English letters. Find the longest word from the given string.
Example
For text = "Ready, steady, go!"
, the output should be
longestWord(text) = "steady"
.
Input/Output
-
[execution time limit]
4 seconds (py3) -
[input] string text
Guaranteed constraints:4 ≤ text.length ≤ 50
. -
[output] string
The longest word fromtext
. It’s guaranteed that there is a unique output.
My Solution
import re
def longestWord(text):
wordList = re.findall('[a-zA-Z]+', text)
lengthList = [len(word) for word in wordList]
ix_longest = lengthList.index(max(lengthList))
return wordList[ix_longest]