RosettaCodeData/Task/Longest-common-subsequence/Haskell/longest-common-subsequence-1.hs
Ingy döt Net db842d013d A-M baby
2013-04-10 21:29:02 -07:00

7 lines
190 B
Haskell

longest xs ys = if length xs > length ys then xs else ys
lcs [] _ = []
lcs _ [] = []
lcs (x:xs) (y:ys)
| x == y = x : lcs xs ys
| otherwise = longest (lcs (x:xs) ys) (lcs xs (y:ys))