Longest palindromic substrings: Difference between revisions
m
→{{header|F_Sharp|F#}}
(Realize in F#) |
|||
Line 9:
=={{header|F_Sharp|F#}}==
===
<lang fsharp>
// Mahacher Function. Nigel Galloway: October 1st., 2020
let
let rec fN i g e (l:int[])=match g>=0 && e<s.Length && s.[g]=s.[e] with true->l.[i]<-l.[i]+1; fN i (g-1) (e+1) l |_->()
let rec fGo n g Ʃ=match Ʃ<s.Length with
Line 29:
<lang fsharp>
let fN g=if g=[||] then (0,0) else g|>Array.mapi(fun n g->(n,g))|>Array.maxBy snd
let lpss s=let n,g=
let test = ["three old rotators"; "never reverse"; "stable was I ere I saw elbatrosses"; "abracadabra"; "drome"; "the abbatial palace"; ""]
test|>List.iter(fun n->printfn "A longest palindromic substring of \"%s\" is \"%s\"" n (lpss n))
Line 43:
A longest palindromic substring of "" is ""
</pre>
=={{header|Go}}==
{{trans|Wren}}
| |||