出道题给大家耍下，有闲的各位请接招

[northisland]

有这样的输入字符串
“ tt2012g2 ”


求该字符串中，最长的连续数字子串。

语言不限～： P

[scarlex]

@myid

Haskell

getNumbers [] = [[]]
getNumbers xs = [ys] ++ getNumbers zs'
____where (ys, ys') = span (\x -> x `elem` ['0'..'9']) xs
__________(zs, zs') = break (\x -> x `elem` ['0'..'9']) ys'

getLongest = (foldr f "") . getNumbers
____where f x y = if (length x > length y) then x else y

不用正则，只用预设函数写出来的版本~