Longest palindromic substrings: Difference between revisions
→{{header|Haskell}}: Slightly expanded range of examples
(→{{header|Haskell}}: Slightly expanded range of examples) |
|||
Line 96:
longestPalindromes :: String -> ([String], Int)
longestPalindromes s = (filter ((w ==) . length)
where
xs = palindromes s
cs =
w = maximum $ length <$> xs▼
if null xs
then return <$> s
else xs
w =
if null xs
then 1
palindromes :: String -> [String]
Line 120 ⟶ 127:
| x == y ]
go _ = []
--------------------------- TEST -------------------------
Line 134 ⟶ 142:
, "stable was I ere I saw elbatrosses"
, "abracadabra"
, "drome"
, "abba"
]
Line 150 ⟶ 160:
"never reverse" -> (["ever reve"],9)
"stable was I ere I saw elbatrosses" -> (["table was I ere I saw elbat"],27)
"abracadabra" -> (["aca","ada"],3)
"drome" -> (["d","r","o","m","e"],1)
"abba" -> (["abba"],4)</pre>
=={{header|Julia}}==
| |||